@book{c5c51169a94b44dcb2b0473c2f4eee7d,

title = "Long D3-cycles in graphs with large minimum degree",

abstract = "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.",

keywords = "METIS-141165, IR-30525",

author = "H. Trommel",

note = "Memorandum fac. TW nr 1368 ",

year = "1997",

language = "Undefined",

isbn = "0169-2690",

series = "Memorandum / University of Twente, Faculty of Applied Mathematics",

publisher = "Universiteit Twente",

number = "1368",

}