A degree characterisation of pancyclicity

DOI10.1016/0012-365X(92)00464-3MaRDI QIDQ1322211zbMATH OpenOpenAlexFDO

Authors 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)

Review text

A graph \(G\) of order \(n\) is said to be in the class \(O(n-1)\) if \(\deg (u) + \deg (v) \geq n - 1\) for every pair of nonadjacent vertices \(u\), \(v \in V(G)\). The paper presents a characterisation of those graphs in \(O(n-1)\) which are pancyclic.

Recommendations

• scientific article; zbMATH DE number 223941
• scientific article; zbMATH DE number 62447
• An Ore-type condition for pancyclability

Cites work

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

Cited in

(2)

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

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

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