Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs

DOI10.1002/JGT.22852zbMath1522.05267arXiv2103.06760OpenAlexW4283169161WikidataQ114236126 ScholiaQ114236126MaRDI QIDQ6046653

Katsuhiro Ota, Unnamed Author

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

2-factorHamiltonian cycletoughness\(2K_2\)-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ Existence of 2-factors in tough graphs without forbidden subgraphs ⋮ 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

• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Chordality and 2-factors in tough graphs
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Graph Theory
• Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs
• Toughness and the existence ofk-factors
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs

This page was built for publication: Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs