Hamiltonian Circuits on Simple 3-Polytopes

DOI10.1112/JLMS/S2-5.3.504MaRDI QIDQ5652716zbMATH OpenOpenAlexFDO

Authors Paul Goodey

Publication date 1972

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-5.3.504

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Polytopes and polyhedra (52Bxx)

Cited in

(5)

• 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
• 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 Q5652716)