Long D3-cycles in graphs with large minimum degree
Huib Trommel · University of Twente Research Information · 1997
It is shown that if G is a 2-connected graph on n vertices, with minimum degree such that n≤4δ−6, and with a maximum independent set of cardinality , then G contains a cycle of length at least min {n,n+2δ−2α−2g or G ε F, where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.