Every 5-connected planar triangulation is 4-ordered Hamiltonian

MaRDI QIDQ307916zbMATH OpenFDO

Authors Kenta Ozeki

Publication date 5 September 2016

Published in Journal of Algebra Combinatorics Discrete Structures and Applications (Search for Journal in Brave)

zbMATH Keywords

triangulationsplane graphs4-ordered graph4-ordered Hamiltonian

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• 4-connected triangulations and 4-orderedness
• 4-connected maximal planar graphs are 4-ordered
• Counting Hamiltonian cycles in planar triangulations
• On Hamiltonian cycles in 4- and 5-connected plane triangulations
• 7-connected graphs are 4-ordered

Cites work

• scientific article; zbMATH DE number 1002024 (Why is no real title available?)
• 4-connected maximal planar graphs are 4-ordered
• 4-connected projective planar graphs are Hamiltonian
• 4-connected projective-planar graphs are Hamiltonian-connected
• 4-connected triangulations and 4-orderedness
• A Theorem on Planar Graphs
• A theorem on paths in planar graphs
• Disjoint paths, planarizing cycles, and spanning walks
• Nonhamiltonian triangulations with large connectivity and representativity
• Simple paths on polyhedra
• Survey of results on \(k\)-ordered graphs
• Trees in triangulations

Cited in

(2)

• 4-connected maximal planar graphs are 4-ordered
• 5-Connected Toroidal Graphs are Hamiltonian-Connected

This page was built for publication: Every 5-connected planar triangulation is 4-ordered Hamiltonian

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