An Ore-type condition for Hamiltonicity in tough graphs
From MaRDI portal
Publication:2073293
DOI10.37236/10389zbMath1485.05098arXiv2103.05146OpenAlexW4210574511MaRDI QIDQ2073293
Publication date: 1 February 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.05146
Related Items (4)
Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs ⋮ Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs ⋮ An Ore-type condition for hamiltonicity in tough graphs and the extremal examples ⋮ Toughness, Hamiltonicity and spectral radius in graphs
Cites Work
- Long cycles in graphs with large degree sums
- Existence of Dlambda-cycles and Dlambda-paths
- Long cycles in graphs with prescribed toughness and minimum degree
- Not every 2-tough graph is Hamiltonian
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs
- Toughness in graphs -- a survey
- Tough graphs and Hamiltonian circuits.
- Note on Hamilton Circuits
- On Maximal Circuits in Finite Graphs
- Some Theorems on Abstract Graphs
This page was built for publication: An Ore-type condition for Hamiltonicity in tough graphs