An implicit degree Ore-condition for pancyclicity of graphs

DOI10.1007/S10114-013-1641-2zbMath1277.05092OpenAlexW2008184403MaRDI QIDQ383626

Hao Li, Jun-qing Cai

Publication date: 5 December 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-013-1641-2

zbMATH Keywords

graphHamilton cyclepancyclicimplicit degree

Mathematics Subject Classification ID

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

Related Items (1)

A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs

Cites Work

• Unnamed Item
• Implicit-degrees and circumferences
• An implicit degree condition for long cycles in 2-connected graphs
• A cycle structure theorem for Hamiltonian graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• Pancyclic graphs. I
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs

This page was built for publication: An implicit degree Ore-condition for pancyclicity of graphs