Pancyclic graphs and a conjecture of Bondy and Chvatal
From MaRDI portal
Publication:1394236
DOI10.1016/0095-8956(74)90043-4zbMath0279.05120OpenAlexW2008357727MaRDI QIDQ1394236
Edward F. Schmeichel, S. Louis Hakimi
Publication date: 1974
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(74)90043-4
Related Items
A cycle structure theorem for Hamiltonian graphs ⋮ Some spectral sufficient conditions for a graph being pancyclic ⋮ Hamiltonian degree conditions for tough graphs ⋮ Small cycles in Hamiltonian graphs ⋮ Hamiltonian paths, unit-interval complexes, and determinantal facet ideals ⋮ A new Chvátal type condition for pancyclicity ⋮ An implicit degree condition for pancyclicity of graphs ⋮ An implicit degree Ore-condition for pancyclicity of graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Hamiltonian degree conditions which imply a graph is pancyclic ⋮ Best monotone degree conditions for binding number ⋮ Graphs and degree sequences. I ⋮ A condition for a Hamiltonian bipartite graph to be bipancyclic ⋮ Some recent results in hamiltonian graphs ⋮ Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \) ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Frequency partitions: Forcibly pancyclic and forcibly nonhamiltonian degree sequences ⋮ Locally pancyclic graphs ⋮ On cycle lengths in graphs of moderate degree
Cites Work