Sciweavers

JCT
2010
110views more  JCT 2010»
13 years 11 months ago
Pancyclicity of Hamiltonian and highly connected graphs
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
Peter Keevash, Benny Sudakov