A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs

DOI10.1016/j.disc.2022.113081zbMath1506.05114arXiv2202.06192OpenAlexW4285992051WikidataQ114190479 ScholiaQ114190479MaRDI QIDQ2675842

Lingjuan Shi, Songling Shan

Publication date: 26 September 2022

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

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

• Forbidden subgraphs for Hamiltonicity of 1-tough graphs
• 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
• A note on Hamiltonian circuits
• Tough graphs and Hamiltonian circuits.
• Hamiltonian cycles in 3‐tough 2K₂‐free graphs
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs