On certain Hamiltonian inner triangulations

DOI10.1016/0166-218X(93)90111-ZzbMath0785.05062MaRDI QIDQ2367404

Robert J. Cimikowski

Publication date: 10 August 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmHamiltonian cycleplanar graphDelaunay triangulationinner triangulationsimply-nested inner triangulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Finding Hamiltonian cycles in Delaunay triangulations is NP-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-Hamiltonian, nondegenerate Delaunay triangulation
• Embedding planar graphs in four pages
• An upper bound on the shortness exponent of inscribable polytopes
• Hamiltonian circuits in random graphs
• Finding the intersection of two convex polyhedra
• Parallel concepts in graph theory
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• Some properties of the planar Euclidean relative neighbourhood graph
• Hamiltonian cycles in planar triangulations with no separating triangles

This page was built for publication: On certain Hamiltonian inner triangulations