Hamilton Circuits of Convex Trivalent Polyhedra (Up to 18 Vertices)

DOI10.2307/2314879zbMath0147.42702OpenAlexW4249392084MaRDI QIDQ5525910

J. Lederberg

Publication date: 1967

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2314879

zbMATH Keywords

topology

Related Items (9)

Every simple 3-polytype with 34 vertices is Hamiltonian ⋮ The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices ⋮ Polytopes, graphs, and complexes ⋮ Hamiltonian circuits in simple 3-polytopes with up to 26 vertices ⋮ Acyclic colorings of planar graphs ⋮ A spectral approach to the shortest path problem ⋮ Hamiltonian circuits in prisms over certain simple 3-polytopes ⋮ Hamiltonian circuits on simple 3-polytopes ⋮ Shortness exponents of families of graphs

This page was built for publication: Hamilton Circuits of Convex Trivalent Polyhedra (Up to 18 Vertices)