Every 5-connected planar triangulation is 4-ordered Hamiltonian

zbMATH Open1346.05042MaRDI QIDQ307916FDOQ307916

Authors: Kenta Ozeki 

Publication date: 5 September 2016

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

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

zbMATH Keywords

triangulationsplane graphs4-ordered graph4-ordered Hamiltonian

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Theorem on Planar Graphs
• 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 paths in planar graphs
• Survey of results on \(k\)-ordered graphs
• 4-connected triangulations and 4-orderedness

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)