Toughness, forbidden subgraphs, and Hamilton-connected graphs

DOI10.7151/dmgt.2247zbMath1479.05183OpenAlexW2983611214WikidataQ126844859 ScholiaQ126844859MaRDI QIDQ2062680

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

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2247

zbMATH Keywords

Hamiltonicitytoughnessforbidden subgraphHamilton-connected graph

Mathematics Subject Classification ID

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

Related Items

Toughness, forbidden subgraphs and pancyclicity

Cites Work

• Forbidden subgraphs for Hamiltonicity of 1-tough graphs
• On a class of posets and the corresponding comparability graphs
• Toughness, hamiltonicity and split graphs
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Not every 2-tough graph is Hamiltonian
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• Toughness, minimum degree, and the existence of 2‐factors
• Unnamed Item
• Unnamed Item
• Unnamed Item