Every 4-Connected Graph with Crossing Number 2 is Hamiltonian

DOI10.1137/17M1138443zbMath1401.05175OpenAlexW2902053870WikidataQ128892679 ScholiaQ128892679MaRDI QIDQ4561263

Carol T. Zamfirescu, Kenta Ozeki

Publication date: 5 December 2018

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

Full work available at URL: https://doi.org/10.1137/17m1138443

zbMATH Keywords

Hamiltonian cyclecrossing number3-cuts

Mathematics Subject Classification ID

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

Related Items (3)

On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ 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
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Planar and infinite hypohamiltonian and hypotraceable graphs
• 4-connected projective planar graphs are Hamiltonian
• 4-connected projective-planar graphs are Hamiltonian-connected
• Hamilton paths in toroidal graphs
• A Theorem on Planar Graphs
• A planar hypohamiltonian graph with 48 vertices
• Hamilton cycles in plane triangulations
• On Hamilton cycles in certain planar graphs
• Polytopes, graphs, and complexes
• A theorem on paths in planar graphs

This page was built for publication: Every 4-Connected Graph with Crossing Number 2 is Hamiltonian