A degree characterisation of pancyclicity

DOI10.1016/0012-365X(92)00464-3zbMath0805.05067OpenAlexW2066216526MaRDI QIDQ1322211

R. E. L. Aldred, Zhang Ke Min, Derek Holton

Publication date: 26 January 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00464-3

zbMATH Keywords

characterisationdegreeOre conditionpancyclicity

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (2)

Cycles through given vertices and closures ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem

Cites Work

• A cycle structure theorem for Hamiltonian graphs
• Pancyclic graphs. I
• Note on Hamilton Circuits
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees

This page was built for publication: A degree characterisation of pancyclicity