An Ore-type condition for hamiltonicity in tough graphs and the extremal examples

DOI10.37236/12483arXiv2210.17006MaRDI QIDQ6194261

Songling Shan, Unnamed Author

Publication date: 19 March 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.17006

zbMATH Keywords

Ore's theoremChvátal's toughness conjecturetoughness of a graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Long cycles in graphs with large degree sums
• Arc coverings of graphs
• Existence of Dlambda-cycles and Dlambda-paths
• Long cycles in graphs with prescribed toughness and minimum degree
• Not every 2-tough graph is Hamiltonian
• An Ore-type condition for Hamiltonicity in tough graphs
• Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
• A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs
• On Maximal Circuits in Finite Graphs
• Hamiltonian cycles in 3‐tough 2K₂‐free graphs
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs
• Some Theorems on Abstract Graphs
• Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs
• Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs

This page was built for publication: An Ore-type condition for hamiltonicity in tough graphs and the extremal examples