Minimum degrees of minimally 1k-tough graphs

DOI10.4208/AAM.OA-2025-0020MaRDI QIDQ7319602zbMATH OpenFDO

Authors Kai Gao, Jing Chen, Shiyu Cao

Publication date 26 August 2026

Published in Annals of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/AAM.OA-2025-0020

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40)

Cites work

• Disproof of a conjecture on minimally \(t\)-tough graphs
• Minimal toughness in special graph classes
• Not every 2-tough graph is Hamiltonian
• On minimally t-tough graphs with t 1
• 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
• The structure of minimally 1-tough graphs with small independence number
• The structure of minimally t-tough, 2K₂-free graphs
• Tough graphs and Hamiltonian circuits.
• Various results on the toughness of graphs

This page was built for publication: Minimum degrees of minimally \(\frac{1}{k}\)-tough graphs

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