Every 5-connected planar triangulation is 4-ordered Hamiltonian

zbMath1346.05042MaRDI QIDQ307916

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)

Cites Work

• Unnamed Item
• 4-connected triangulations and 4-orderedness
• Trees in triangulations
• 4-connected projective planar graphs are Hamiltonian
• 4-connected maximal planar graphs are 4-ordered
• Nonhamiltonian triangulations with large connectivity and representativity
• 4-connected projective-planar graphs are Hamiltonian-connected
• Simple paths on polyhedra
• Disjoint paths, planarizing cycles, and spanning walks
• A Theorem on Planar Graphs
• A theorem on paths in planar graphs
• Survey of results on \(k\)-ordered graphs

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