A cycle structure theorem for Hamiltonian graphs
From MaRDI portal
Publication:1085183
DOI10.1016/0095-8956(88)90058-5zbMath0607.05050OpenAlexW2985590381MaRDI QIDQ1085183
S. Louis Hakimi, Edward F. Schmeichel
Publication date: 1988
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(88)90058-5
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)
Related Items
On the structure of the set of cycle lengths in a Hamiltonian graph, Hamiltonian degree conditions for tough graphs, On the cycle spectrum of cubic Hamiltonian graphs, An implicit degree condition for pancyclicity of graphs, Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum, An implicit degree Ore-condition for pancyclicity of graphs, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, 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, A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs, Hamiltonian degree conditions which imply a graph is pancyclic, Cycle spectra of Hamiltonian graphs, A condition for a Hamiltonian bipartite graph to be bipancyclic, Applying a condition for a Hamiltonian bipartite graph to be bipancyclic, A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs, A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs, Fan's condition on induced subgraphs for circumference and pancyclicity, The cycle spectrum of claw-free Hamiltonian graphs, A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness, A new sufficient condition for pancyclability of graphs, Removable matchings and Hamiltonian cycles, Cycles in Hamiltonian graphs of prescribed maximum degree, Dirac's type sufficient conditions for hamiltonicity and pancyclicity, Another cycle structure theorem for Hamiltonian graphs, Locally pancyclic graphs, A degree characterisation of pancyclicity
Cites Work
- Unnamed Item
- New sufficient conditions for cycles in graphs
- Hamiltonian degree conditions which imply a graph is pancyclic
- On a conjecture of Bondy
- 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
