An upper bound on the shortness exponent of inscribable polytopes

DOI10.1016/0095-8956(89)90008-7zbMath0676.05060OpenAlexW2064339860MaRDI QIDQ1122592

Michael B. Dillencourt

Publication date: 1989

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(89)90008-7

zbMATH Keywords

Hamiltonian circuitDelaunay triangulations3-polytopeshortness exponentinscribable

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items (7)

On certain Hamiltonian inner triangulations ⋮ Finding Hamiltonian cycles in Delaunay triangulations is NP-complete ⋮ Connectivity of plane triangulations ⋮ Finding Hamiltonian cycles in certain planar graphs ⋮ Coloring certain proximity graphs ⋮ Toughness and Delaunay triangulations ⋮ An upper bound on the shortness exponent of 1-tough, maximal planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Traveling salesman cycles are not always subgraphs of Voronoi duals
• Voronoi diagrams and arrangements
• A non-Hamiltonian, nondegenerate Delaunay triangulation
• Voronoi diagrams from convex hulls
• Tough graphs and Hamiltonian circuits.
• Shortness exponents of families of graphs
• Simple paths on polyhedra
• Connect-the-dots: A new heuristic

This page was built for publication: An upper bound on the shortness exponent of inscribable polytopes