On minimally t-tough (K₁ K₁,3)-free graphs

DOI10.1016/J.DAM.2026.06.008MaRDI QIDQ7304706zbMATH OpenFDO

Authors Kai Gao, Jing Chen, Wei Zheng

Publication date 28 July 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2026.06.008

Mathematics Subject Classification ID

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

Cites work

• Constructions of minimally t-tough regular graphs
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Disproof of a conjecture on minimally \(t\)-tough graphs
• Hamiltonian results inK1,3-free graphs
• Minimal toughness in special graph classes
• 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: On minimally \(t\)-tough \((K_1 \cup K_{1,3})\)-free graphs

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