Hamiltonian degree conditions which imply a graph is pancyclic

DOI10.1016/0095-8956(90)90133-KzbMath0698.05047OpenAlexW2082876092MaRDI QIDQ912127

Douglas Bauer, Edward F. Schmeichel

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90133-k

zbMATH Keywords

special cyclic structure of Hamiltonian graphs

Mathematics Subject Classification ID

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

Related Items

A cycle structure theorem for Hamiltonian graphs, A new Chvátal type condition for pancyclicity, Estimates on the size of the cycle spectra of Hamiltonian graphs, Cycles of many lengths in Hamiltonian graphs, Cycle lengths of Hamiltonian \(P_\ell\)-free graphs, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Cycle spectra of Hamiltonian graphs, Best monotone degree conditions for graph properties: a survey, Applying a condition for a Hamiltonian bipartite graph to be bipancyclic, Locally pancyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in 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
• On Hamilton's ideals
• Some Theorems on Abstract Graphs