An upper bound on the shortness exponent of 1-tough, maximal planar graphs
From MaRDI portal
Publication:805630
DOI10.1016/0012-365X(91)90099-NzbMATH Open0729.05029MaRDI QIDQ805630FDOQ805630
Authors: Michael B. Dillencourt 
Publication date: 1991
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Graph theory
- Toughness and Delaunay triangulations
- Simple paths on polyhedra
- Tough graphs and Hamiltonian circuits.
- Title not available (Why is that?)
- Shortness exponents of families of graphs
- Recognizing tough graphs is NP-hard
- A 1-tough nonhamiltonian maximal planar graph
- An upper bound on the shortness exponent of inscribable polytopes
- Some problems on polyhedra
Cited In (13)
- Toughness in graphs -- a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
- The complexity of recognizing tough cubic graphs
- Toughness and Hamiltonicity of a class of planar graphs
- Toughness and spanning trees in K4‐minor‐free graphs
- Toughness and Delaunay triangulations
- Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles
- Toughness and nonhamiltonicity of polyhedral graphs
- Maximum and minimum toughness of graphs of small genus
- On the shortness exponent of 1-tough, maximal planar graphs
This page was built for publication: An upper bound on the shortness exponent of 1-tough, maximal planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805630)
