Every simple 3-polytope of order 32 or less is Hamiltonian
From MaRDI portal
Publication:3955387
DOI10.1002/jgt.3190060213zbMath0493.05043OpenAlexW2016431111MaRDI QIDQ3955387
Publication date: 1982
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190060213
Convex sets in (3) dimensions (including convex surfaces) (52A15) Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)
Related Items (4)
Every simple 3-polytype with 34 vertices is Hamiltonian ⋮ The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices ⋮ Regular non-Hamiltonian polyhedral graphs ⋮ Hamiltonian cycles in cubic 3-connected bipartite planar graphs
Cites Work
This page was built for publication: Every simple 3-polytope of order 32 or less is Hamiltonian