A large class of maximally tough graphs

DOI10.1007/BF01720148zbMath0758.05059MaRDI QIDQ1182141

Lynne L. Doty

Publication date: 27 June 1992

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclestoughnessmaximally tough graphsvulnerability measure

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (3)

Extreme tenacity of graphs with given order and size ⋮ Toughness in graphs -- a survey ⋮ A survey of some network reliability analysis and synthesis results

Cites Work

• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• The connectivities of line and total graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Unnamed Item
• Unnamed Item

This page was built for publication: A large class of maximally tough graphs