Properties of minimally \(t\)-tough graphs

DOI10.1016/J.DISC.2017.08.033zbMath1372.05108arXiv1604.02746OpenAlexW2964219321MaRDI QIDQ2411622

Kitti Varga, Gyula Y. Katona, Daniel Soltész

Publication date: 24 October 2017

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

Full work available at URL: https://arxiv.org/abs/1604.02746

zbMATH Keywords

claw-free graphtoughnessembedded subgraphminimally \(t\)-tough

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

The complexity of recognizing minimally tough graphs ⋮ The structure of minimally \(t\)-tough, \(2K_2\)-free graphs ⋮ On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs

Cites Work

• Unnamed Item
• A remark on Hamiltonian cycles
• On the complexity of recognizing tough graphs
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: Properties of minimally \(t\)-tough graphs