Disproof of a conjecture on minimally t-tough graphs

DOI10.1016/J.DISC.2024.113982MaRDI QIDQ6542016zbMATH OpenFDO

Authors Wei Zheng, Lei Sun

Publication date 21 May 2024

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimum degreetoughnessminimally \(t\)-tough graph

Mathematics Subject Classification ID

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

Recommendations

• The structure of minimally \(t\)-tough, \(2K_2\)-free graphs
• Properties of minimally \(t\)-tough graphs
• On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs
• Minimal toughness in special graph classes

Cites work

• Graph theory
• Not every 2-tough graph is Hamiltonian
• On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs
• Properties of minimally \(t\)-tough graphs
• Tough graphs and Hamiltonian circuits.
• Various results on the toughness of graphs

Cited in

(1)

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

This page was built for publication: Disproof of a conjecture on minimally \(t\)-tough graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542016)