The structure of minimally \(t\)-tough, \(2K_2\)-free graphs

DOI10.1016/j.dam.2023.11.034OpenAlexW4389469578MaRDI QIDQ6153459

Xiao-Min Hu, Hui Ma, Weihua Yang

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.11.034

zbMATH Keywords

minimum degreetoughness\(2K_2\)-free graphsminimally \(1/a\)-tough graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• 10-tough chordal graphs are Hamiltonian
• A 1-tough nonhamiltonian maximal planar graph
• Not every 2-tough graph is Hamiltonian
• Characterization of 1-tough graphs using factors
• Properties of minimally \(t\)-tough graphs
• Tough graphs and Hamiltonian circuits. (Reprint)
• On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs
• Various results on the toughness of graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: The structure of minimally \(t\)-tough, \(2K_2\)-free graphs