Hamiltonian circuits in simple 3-polytopes with up to 26 vertices

DOI10.1007/BF02757714zbMath0302.05102OpenAlexW2027286987MaRDI QIDQ1215510

D. W. Barnette, G. Wegner

Publication date: 1975

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02757714

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

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

• Unnamed Item
• Non-Hamiltonian cubic planar maps
• Hamiltonian circuits on simple 3-polytopes
• Hamilton Circuits of Convex Trivalent Polyhedra (Up to 18 Vertices)
• Polytopes, graphs, and complexes
• Hamiltonian Circuits on Simple 3-Polytopes

This page was built for publication: Hamiltonian circuits in simple 3-polytopes with up to 26 vertices