On the shortness exponent of 1-tough, maximal planar graphs
From MaRDI portal
Publication:1918570
DOI10.1016/0012-365X(94)00356-NzbMath0852.05055MaRDI QIDQ1918570
Publication date: 25 November 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
Related Items
Unnamed Item, Toughness and Hamiltonicity of a class of planar graphs, Toughness in graphs -- a survey
Cites Work
- Unnamed Item
- Unnamed Item
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- A 1-tough nonhamiltonian maximal planar graph
- Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
- Toughness and nonhamiltonicity of polyhedral graphs
- Tough graphs and Hamiltonian circuits.
- Shortness exponents of families of graphs
- Hamiltonian circuits on 3-polytopes