On the toughness index of planar graphs

DOI10.1002/jgt.3190180110zbMath0788.05031OpenAlexW2102736825MaRDI QIDQ4277991

Michael B. Dillencourt

Publication date: 30 May 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180110

zbMATH Keywords

NP-hardplanar graphtoughness index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

The complexity of recognizing tough cubic graphs ⋮ Toughness in graphs -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Recognizing tough graphs is NP-hard
• Polyhedra of small order and their Hamiltonian properties
• Tough graphs and Hamiltonian circuits.
• Shortness exponents of families of graphs

This page was built for publication: On the toughness index of planar graphs