Polyhedra with few 3-cuts are Hamiltonian

zbMath1409.05122arXiv1606.01693MaRDI QIDQ1732035

Gunnar Brinkmann, Carol T. Zamfirescu

Publication date: 15 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.01693

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ 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 ⋮ A counterexample to prism-Hamiltonicity of 3-connected planar graphs ⋮ Hamiltonian cycles in 4-connected plane triangulations with few 4-separators ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ 4-connected polyhedra have at least a linear number of Hamiltonian cycles ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ Non-Hamiltonian 1-tough triangulations with disjoint separating triangles ⋮ $K_2$-Hamiltonian Graphs: I

Uses Software

• plantri

Cites Work

• Scattering number and extremal non-Hamiltonian graphs
• 4-connected projective planar graphs are Hamiltonian
• On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
• A Theorem on Planar Graphs
• On the number of hamiltonian cycles in triangulations with few separating triangles
• Hamilton cycles in plane triangulations
• Unnamed Item
• Unnamed Item