Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs

DOI10.1016/j.disc.2023.113755arXiv2303.09741OpenAlexW4387806281MaRDI QIDQ6184533

No author found.

Publication date: 25 January 2024

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

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

zbMATH Keywords

Hamiltonian graphtoughness\(( P_2 \cup k P_1)\)-free graph

Mathematics Subject Classification ID

Combinatorics (05-XX) Number theory (11-XX)

Cites Work

• Unnamed Item
• Forbidden subgraphs for Hamiltonicity of 1-tough graphs
• 10-tough chordal graphs are Hamiltonian
• Toughness and Hamiltonicity in \(k\)-trees
• 1-tough cocomparability graphs are hamiltonian
• 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
• A note on Hamiltonian circuits
• Tough graphs and Hamiltonian circuits.
• Hamiltonian cycles in 1-tough 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
• 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
• Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs

This page was built for publication: Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs