Long cycles in 3-cyclable graphs

It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α, thenG contains a cycle of length at least min {n, 3δ − 3,n+ δ − α}