Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs

DOI10.1016/j.disc.2023.113841arXiv2210.10408OpenAlexW4389589810MaRDI QIDQ6177437

Katsuhiro Ota, Unnamed Author

Publication date: 17 January 2024

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

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

zbMATH Keywords

Hamiltonian cycletoughness\(( K_2 \cup k K_1)\)-free graph

Mathematics Subject Classification ID

Graph theory (05Cxx) Ordered sets (06Axx) Combinatorics (05-XX)

Related Items (1)

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

Cites Work

• Forbidden subgraphs for Hamiltonicity of 1-tough graphs
• On a class of posets and the corresponding comparability graphs
• Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Not every 2-tough graph is Hamiltonian
• 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
• Graph Theory
• 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: Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs