scientific article; zbMATH DE number 1536530

MaRDI QIDQ4518404zbMATH OpenFDO

Authors Peter J. Owens

Publication date 28 November 2000

zbMATH Keywords

maximal planar graphtoughnessnon-hamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Non-hamiltonian 5 4-tough maximal planar graphs
• Maximum nonhamiltonian tough graphs
• Toughness and nonhamiltonicity of polyhedral graphs
• An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
• An upper bound on the shortness exponent of 1-tough, maximal planar graphs

Cited in

(13)

• Toughness in graphs -- a survey
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
• The number of defective colorings of graphs on surfaces
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
• Toughness and Hamiltonicity of a class of planar graphs
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Maximal nontraceable graphs with toughness less than one
• On the toughness index of planar graphs
• Non-hamiltonian 5 4-tough maximal planar graphs
• Planar graphs, Hamilton cycles and extreme independence number
• Toughness and nonhamiltonicity of polyhedral graphs
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518404)