Forbidden subgraphs and 2‐factors in 3/2‐tough graphs

DOI10.1002/jgt.22916zbMath1522.05318arXiv2110.01281OpenAlexW3202435412MaRDI QIDQ6074577

Unnamed Author

Publication date: 12 October 2023

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

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

zbMATH Keywords

2-factorHamiltonian cycletoughness\((P_4 \cup P_{10})\)-free graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• 10-tough chordal graphs are Hamiltonian
• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Chordality and 2-factors in tough graphs
• Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs
• Vizing's 2-factor conjecture involving toughness and maximum degree conditions
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Graph Theory
• Toughness and the existence ofk-factors
• Toughness, minimum degree, and the existence of 2‐factors
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs
• Tough spiders
• The Factors of Graphs
• Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs

This page was built for publication: Forbidden subgraphs and 2‐factors in 3/2‐tough graphs