Forbidden subgraphs for Hamiltonicity of 1-tough graphs

DOI10.7151/dmgt.1897zbMath1350.05088OpenAlexW2531177258MaRDI QIDQ339484

Bin Long Li, Sheng Gui Zhang, Hajo J. Broersma

Publication date: 11 November 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1897

zbMATH Keywords

Hamiltonian graph1-tough graphforbidden subgraph\(H\)-free graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

On hamiltonicity of 1-tough triangle-free graphs ⋮ 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 ⋮ Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs ⋮ Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs ⋮ Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity ⋮ Unnamed Item ⋮ Toughness, forbidden subgraphs and pancyclicity ⋮ Toughness, forbidden subgraphs, and Hamilton-connected graphs

Cites Work

• Unnamed Item
• On a class of posets and the corresponding comparability graphs
• Characterizing forbidden pairs for hamiltonian properties
• On some intriguing problems in Hamiltonian graph theory---a survey
• Long cycles in graphs with prescribed toughness and minimum degree
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Not every 2-tough graph is Hamiltonian
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs

This page was built for publication: Forbidden subgraphs for Hamiltonicity of 1-tough graphs