5-Connected Toroidal Graphs are Hamiltonian-Connected

DOI10.1137/151002812zbMath1329.05180OpenAlexW2291478427MaRDI QIDQ3462548

Kenta Ozeki, Ken-ichi Kawarabayashi

Publication date: 15 January 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/87e3be2fae1ee3866c0be8478c148eee4b01f353

zbMATH Keywords

HamiltoniantorusHamiltonian-connectedTutte paths

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 (3)

Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 4-connected projective planar graphs are Hamiltonian
• Five-connected toroidal graphs are Hamiltonian
• 4-connected projective-planar graphs are Hamiltonian-connected
• 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
• On Hamiltonian Circuits
• A theorem on paths in planar graphs
• A theorem on paths in planar graphs

This page was built for publication: 5-Connected Toroidal Graphs are Hamiltonian-Connected