4-connected projective-planar graphs are Hamiltonian-connected

DOI10.1016/J.JCTB.2014.11.006MaRDI QIDQ2343285zbMATH OpenOpenAlexFDO

Authors 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

4-connected graphHamiltonian-connected graphprojective plane

Mathematics Subject Classification ID

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

Recommendations

• 4-connected projective-planar graphs are Hamiltonian-connected
• 4-connected projective planar graphs are Hamiltonian
• scientific article; zbMATH DE number 1002024
• A new proof that 4-connected planar graphs are Hamiltonian-connected
• 5-Connected Toroidal Graphs are Hamiltonian-Connected

Cites work

• 4-connected projective planar graphs are Hamiltonian
• 4-connected projective-planar graphs are Hamiltonian-connected
• A theorem on paths in planar graphs
• A theorem on paths in planar graphs
• A Theorem on Planar Graphs
• Five-connected toroidal graphs are Hamiltonian
• Graphs on surfaces
• Hamilton cycles in 4-connected troidal triangulations
• Hamilton paths in toroidal graphs
• scientific article; zbMATH DE number 1002024 (Why is no real title available?)
• scientific article; zbMATH DE number 3414331 (Why is no real title available?)
• On Hamiltonian Circuits
• Polytopes, graphs, and complexes
• Simple paths on polyhedra
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs

Cited in

(13)

• 4-connected projective planar graphs are Hamiltonian
• Counting Hamiltonian cycles in planar triangulations
• 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
• 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
• scientific article; zbMATH DE number 866659 (Why is no real title available?)
• Computing Tutte paths
• 4-connected projective-planar graphs are Hamiltonian-connected
• The matching extendability of optimal 1-embedded graphs on the projective plane
• A new proof that 4-connected planar graphs are Hamiltonian-connected
• The price of connectivity augmentation on planar graphs

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

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