Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs

DOI10.37236/8657zbMath1458.05134arXiv1901.02475OpenAlexW3131669016MaRDI QIDQ2227834

Songling Shan

Publication date: 16 February 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\((P_2\cup P_3)\)-free graphtoughness conjecture of Chvátal

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ 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 ⋮ An Ore-type condition for Hamiltonicity in tough graphs

Cites Work

• Factors and factorizations of graphs. Proof techniques in factor theory
• Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• On the existence of two non-neighboring subgraphs in a graph
• Large regular graphs with no induced \(2K_ 2\)
• Long cycles in graphs with prescribed toughness and minimum degree
• Toughness, hamiltonicity and split graphs
• Not every 2-tough graph is Hamiltonian
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs

This page was built for publication: Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs