An implicit degree Ore-condition for pancyclicity of graphs

DOI10.1007/S10114-013-1641-2MaRDI QIDQ383626zbMATH OpenOpenAlexFDO

Authors Hao Li, Junqing 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 cycleimplicit degreepancyclic

Mathematics Subject Classification ID

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

Recommendations

• An implicit degree condition for pancyclicity of graphs
• An implicit degree condition for Hamiltonian cycles
• An implicit degree Dirac condition for Hamiltonian cycles.
• An implicit degree condition for cyclability in graphs
• scientific article; zbMATH DE number 6770098

Cites work

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

Cited in

(3)

• An Ore-type condition for pancyclability
• An implicit degree condition for pancyclicity of graphs
• A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383626)