Hamiltonian circuits on 3-polytopes
From MaRDI portal
Publication:5596076
DOI10.1016/S0021-9800(70)80054-0zbMath0197.49904OpenAlexW1992467241WikidataQ56001760 ScholiaQ56001760MaRDI QIDQ5596076
Ernest Jucovič, D. W. Barnette
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80054-0
Related Items (14)
Planar graphs, Hamilton cycles and extreme independence number ⋮ Polytopes, graphs, and complexes ⋮ On the shortness exponent of 1-tough, maximal planar graphs ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Embedding knots and links in an open book II. Bounds on arc index ⋮ Skeletons on polyhedra ⋮ On the number of hamiltonian cycles in a maximal planar graph ⋮ An upper bound on the length of a Hamiltonian walk of a maximal planar graph ⋮ Hamiltonian paths on 3-polytopes ⋮ Hamiltonian circuits on simple 3-polytopes ⋮ Shortness exponents of families of graphs ⋮ An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs ⋮ Circumference of essentially 4-connected planar triangulations ⋮ Toughness and Delaunay triangulations
This page was built for publication: Hamiltonian circuits on 3-polytopes
