Hamiltonian circuits on simple 3-polytopes

DOI10.1016/0095-8956(73)90032-4MaRDI QIDQ2556413zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A Census of Planar Maps
• Hamilton Circuits of Convex Trivalent Polyhedra (Up to 18 Vertices)
• Hamiltonian circuits on 3-polytopes
• Hamiltonian circuits on simple 3-polytopes
• scientific article; zbMATH DE number 3512154 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3292649 (Why is no real title available?)
• scientific article; zbMATH DE number 3317672 (Why is no real title available?)
• On Hamiltonian Circuits
• Polytopes, graphs, and complexes
• Search for Largest Polyhedra

Cited in

(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
• Regular non-Hamiltonian polyhedral graphs
• Hamiltonian circuits on simple 3-polytopes
• Non-Hamiltonian cubic planar maps
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556413)