A Chvátal--Erdős type condition for pancyclability

DOI10.1016/j.disc.2005.11.093zbMath1115.05048OpenAlexW2036011600MaRDI QIDQ878642

Mariusz Woźniak, Antoni Marczyk, Hao Li, Evelyne Flandrin

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.093

zbMATH Keywords

cyclesindependence numberconnectivitycyclabilityHamiltonian graphspancyclic graphspancyclability

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs
• Cycles through subsets with large degree sums
• Pancyclic graphs. I
• A note on Hamiltonian circuits
• Chvátal-Erdös condition and pancyclism