Toughness and triangle-free graphs

DOI10.1006/jctb.1995.1051zbMath0835.05034OpenAlexW1972264132MaRDI QIDQ1907099

Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel

Publication date: 29 January 1996

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/toughness-and-trianglefree-graphs(ee6816c5-0238-4ede-a907-56aca379d388).html

zbMATH Keywords

triangle-free graphtoughness\(t\)-tough

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (9)

Tough Ramsey graphs without short cycles ⋮ Long cycles in graphs with prescribed toughness and minimum degree ⋮ The Chvátal-Erdös condition for cycles in triangle-free graphs ⋮ Graph toughness from Laplacian eigenvalues ⋮ Triangle-free graphs whose independence number equals the degree ⋮ Toughness in graphs -- a survey ⋮ A Proof of Brouwer's Toughness Conjecture ⋮ A local independence number condition for \(n\)-extendable graphs ⋮ Hamiltonian powers in threshold and arborescent comparability graphs

This page was built for publication: Toughness and triangle-free graphs