Toughness, forbidden subgraphs, and Hamilton-connected graphs
type: Item
instance of: scholarly article
title: Toughness, forbidden subgraphs, and Hamilton-connected graphs
zbMATH Open document ID: 1479.05183
author: Wei Zheng
author: Ligong Wang
author: Hajo Broersma
publication date: 2022-01-03T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C42
zbMATH DE Number: 7451247
zbMATH Keywords: toughness
zbMATH Keywords: forbidden subgraph
zbMATH Keywords: Hamilton-connected graph
zbMATH Keywords: Hamiltonicity
MaRDI profile type: Publication
full work available at URL: dmgt.2247
OpenAlex ID: W2983611214
Wikidata QID: Q126844859
cites work: Toughness, minimum degree, and the existence of 2‐factors
cites work: Not every 2-tough graph is Hamiltonian
cites work: Toughness in graphs -- a survey
cites work: Q5422499
cites work: Q4967194
cites work: Q4500611
cites work: Tough graphs and Hamiltonian circuits.
cites work: On a class of posets and the corresponding comparability graphs
cites work: Toughness, hamiltonicity and split graphs
cites work: Forbidden subgraphs for Hamiltonicity of 1-tough graphs
cites work: Hamiltonian results inK1,3-free graphs
cites work: Disconnected forbidden subgraphs, toughness and Hamilton cycles
DOI: 10.7151/DMGT.2247
published in: Discussiones Mathematicae Graph Theory
Recommended article: Disconnected forbidden subgraphs, toughness and Hamilton cycles
Recommended article: Forbidden subgraphs for Hamiltonicity of 1-tough graphs
Recommended article: Toughness, forbidden subgraphs and pancyclicity
Recommended article: Toughness, hamiltonicity and split graphs
Recommended article: Toughness and Hamiltonicity of a class of planar graphs
Recommended article: Toughness, Hamiltonicity and spectral radius in graphs
Recommended article: Toughness and Hamiltonicity of strictly chordal graphs
Recommended article: Toughness and hamiltonicity in almost claw-free graphs
Recommended article: Q4014493
Recommended article: Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
description: scientific article; zbMATH DE number 7451247