A note on pancyclism of highly connected graphs

DOI10.1016/j.disc.2003.11.045zbMath1050.05073OpenAlexW1964405806MaRDI QIDQ1883250

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

Publication date: 1 October 2004

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

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

zbMATH Keywords

stability numberconnectivityHamiltonian graphspancyclic graphs

Mathematics Subject Classification ID

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

Related Items (3)

Hamiltonicity, independence number, and pancyclicity ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Pancyclicity of Hamiltonian and highly connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Pancyclism in Chvátal-Erdős' graphs
• The Chvátal-Erdös condition for cycles in triangle-free graphs
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• Pancyclic graphs. I
• A note on Hamiltonian circuits
• Weakly pancyclic graphs

This page was built for publication: A note on pancyclism of highly connected graphs