4-connected projective-planar graphs are Hamiltonian-connected

DOI10.1016/j.jctb.2014.11.006zbMath1310.05132OpenAlexW2108311709MaRDI QIDQ2343285

Ken-ichi Kawarabayashi, Kenta Ozeki

Publication date: 4 May 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2014.11.006

zbMATH Keywords

projective planeHamiltonian-connected graph4-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Counting Hamiltonian cycles in planar triangulations ⋮ Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ 5-Connected Toroidal Graphs are Hamiltonian-Connected ⋮ Every 4-Connected Graph with Crossing Number 2 is Hamiltonian ⋮ Computing Tutte Paths ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ 2-edge-Hamiltonian-connectedness of 4-connected plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 4-connected projective planar graphs are Hamiltonian
• Five-connected toroidal graphs are Hamiltonian
• Hamilton paths in toroidal graphs
• Simple paths on polyhedra
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• A Theorem on Planar Graphs
• Polytopes, graphs, and complexes
• 4-connected projective-planar graphs are hamiltonian-connected
• On Hamiltonian Circuits
• A theorem on paths in planar graphs
• A theorem on paths in planar graphs

This page was built for publication: 4-connected projective-planar graphs are Hamiltonian-connected