Hamiltonian circuits on simple 3-polytopes with up to 30 vertices
From MaRDI portal
Publication:1161758
DOI10.2969/jmsj/03420365zbMath0481.05041OpenAlexW2073389852MaRDI QIDQ1161758
Publication date: 1982
Published in: Journal of the Mathematical Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2969/jmsj/03420365
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)
Related Items (2)
The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices ⋮ Hamiltonian cycles in cubic 3-connected bipartite planar graphs
This page was built for publication: Hamiltonian circuits on simple 3-polytopes with up to 30 vertices