Hamiltonian degree conditions for tough graphs
From MaRDI portal
Publication:1896350
DOI10.1016/0012-365X(93)E0214-OzbMath0854.05071OpenAlexW1983807136MaRDI QIDQ1896350
Publication date: 27 August 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0214-o
Related Items (6)
1-tough cocomparability graphs are hamiltonian ⋮ A closure lemma for tough graphs and Hamiltonian degree conditions ⋮ Toughness, Hamiltonicity and spectral radius in graphs ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Toughness in graphs -- a survey ⋮ On the pancyclicity of 1-tough graphs
Cites Work
- Unnamed Item
- A cycle structure theorem for Hamiltonian graphs
- A method in graph theory
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- Pancyclic graphs. I
- On Hamilton's ideals
- Tough graphs and Hamiltonian circuits.
- Pancyclism and small cycles in graphs
- Toughness and the existence ofk-factors
- On Maximal Circuits in Finite Graphs
This page was built for publication: Hamiltonian degree conditions for tough graphs