Disproof of a conjecture on minimally t-tough graphs

DOI10.1016/J.DISC.2024.113982zbMATH Open1539.05019MaRDI QIDQ6542016FDOQ6542016

Lei Sun, Wei Zheng

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)

Cites Work

• Title not available (Why is that?)
• Not every 2-tough graph is Hamiltonian
• Tough graphs and Hamiltonian circuits.
• Properties of minimally \(t\)-tough graphs
• Various results on the toughness of graphs
• On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-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)