Minimal toughness in special graph classes

DOI10.46298/dmtcs.10180zbMATH Open1546.0512MaRDI QIDQ6599813

Gyula Y. Katona, Kitti Varga

Publication date: 6 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

chordal graphssplit graphstoughnessclaw-free graphs\(2K_2\)-free graphsminimally tough graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites Work

• On rigid circuit graphs
• The complexity of facets (and some facets of complexity)
• The toughness of split graphs
• Toughness, hamiltonicity and split graphs
• Properties of minimally \(t\)-tough graphs
• Tough graphs and Hamiltonian circuits.
• The complexity of recognizing minimally tough graphs
• Hamiltonian results inK1,3-free graphs
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs
• Eine Eigenschaft der Atome endlicher Graphen
• Minimally tough chordal graphs with toughness at most $1/2$

This page was built for publication: Minimal toughness in special graph classes