Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs

DOI10.1016/j.disc.2022.113069zbMath1504.05158arXiv2107.08476OpenAlexW4284896273WikidataQ114190488 ScholiaQ114190488MaRDI QIDQ2675828

Songling Shan, Yu-ping Gao

Publication date: 26 September 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian graphstoughness of a graphChvatal toughness conjecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

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 ⋮ An Ore-type condition for hamiltonicity in tough graphs and the extremal examples

Cites Work

• Unnamed Item
• Unnamed Item
• Forbidden subgraphs for Hamiltonicity of 1-tough graphs
• 10-tough chordal graphs are Hamiltonian
• Factors and factorizations of graphs. Proof techniques in factor theory
• Toughness and Hamiltonicity in \(k\)-trees
• Finding Hamiltonian circuits in interval graphs
• 1-tough cocomparability graphs are hamiltonian
• Long cycles in graphs with prescribed toughness and minimum degree
• Toughness, hamiltonicity and split graphs
• 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
• Tough graphs and Hamiltonian circuits.
• A Theorem on Planar Graphs
• More than one tough chordal planar graphs are Hamiltonian
• Hamiltonian cycles in 3‐tough 2K₂‐free graphs
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs
• Tough spiders

This page was built for publication: Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs