On hamiltonicity of 1-tough triangle-free graphs

DOI10.5614/ejgta.2021.9.2.15zbMath1482.05177OpenAlexW3207267858MaRDI QIDQ5061694

Wei Zheng, Li-Gong Wang, Hajo J. Broersma

Publication date: 14 March 2022

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

Full work available at URL: https://doi.org/10.5614/ejgta.2021.9.2.15

zbMATH Keywords

triangle-free graphHamiltonicitytoughnessforbidden subgraph1-tough

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Forbidden subgraphs for Hamiltonicity of 1-tough graphs
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Tough graphs and Hamiltonian circuits.
• Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
• Hamiltonian cycles in 3‐tough 2K₂‐free graphs
• Forbidden subgraph pairs for traceability of block-chains
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs

This page was built for publication: On hamiltonicity of 1-tough triangle-free graphs