Hamiltonian circuits on simple 3-polytopes

DOI10.1016/0095-8956(73)90032-4zbMath0248.05103OpenAlexW2010273295MaRDI QIDQ2556413

J. W. Butler

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(73)90032-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Convex sets in (3) dimensions (including convex surfaces) (52A15)

Related Items (8)

Every simple 3-polytype with 34 vertices is Hamiltonian ⋮ The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices ⋮ Hamiltonian circuits in simple 3-polytopes with up to 26 vertices ⋮ Pairs of Hamiltonian circuits in 5-connected planar graphs ⋮ Non-Hamiltonian cubic planar maps ⋮ Hamiltonian circuits on simple 3-polytopes ⋮ Regular non-Hamiltonian polyhedral graphs ⋮ Hamiltonian cycles in cubic 3-connected bipartite planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian circuits on simple 3-polytopes
• Hamilton Circuits of Convex Trivalent Polyhedra (Up to 18 Vertices)
• Hamiltonian circuits on 3-polytopes
• Polytopes, graphs, and complexes
• Search for Largest Polyhedra
• A Census of Planar Maps
• On Hamiltonian Circuits

This page was built for publication: Hamiltonian circuits on simple 3-polytopes