A sufficient condition for pancyclic graphs

DOI10.1016/J.IPL.2009.05.009zbMath1202.68293OpenAlexW2071892226MaRDI QIDQ989551

Ping Zhang, Yue Lin, Kewen Zhao

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.05.009

zbMATH Keywords

Hamiltonian cyclesinterconnection networkssufficient conditionsHamiltonian pathspancyclic graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Two types of path structures of graphs ⋮ Vertex pancyclicity and new sufficient conditions

Cites Work

• Unnamed Item
• Unnamed Item
• A new sufficient condition for hamiltonicity of graphs
• On Hamiltonian cycles and Hamiltonian paths
• An efficient condition for a graph to be Hamiltonian

This page was built for publication: A sufficient condition for pancyclic graphs