Long Cycles in 3-Cyclable Graphs

摘要

It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree delta and with a maximum independent set of cardinality alpha, then G contains a cycle of length at least min (n,3(delta) - 3, n + delta - alpha).