Every simple 3-polytype with 34 vertices is Hamiltonian

DOI10.1016/0012-365X(86)90036-1zbMath0602.05045MaRDI QIDQ1081618

D. W. Barnette

Publication date: 1986

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

zbMATH Keywords

Hamiltonian cyclecounterexamples to Tait's conjectureOkamura's method

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items (1)

The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generating planar graphs
• Hamiltonian circuits on simple 3-polytopes
• Every simple 3-polytope of order 32 or less is Hamiltonian
• Hamilton Circuits of Convex Trivalent Polyhedra (Up to 18 Vertices)
• Hamiltonian Circuits on Simple 3-Polytopes
• On Hamiltonian Circuits

This page was built for publication: Every simple 3-polytype with 34 vertices is Hamiltonian