algorithmHamiltonian cycleDelaunay triangulationplanar graphinner triangulationsimply-nested inner triangulation
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Recommendations
Cites work
- scientific article; zbMATH DE number 3912424 (Why is no real title available?)
- scientific article; zbMATH DE number 3678974 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3574966 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A non-Hamiltonian, nondegenerate Delaunay triangulation
- An upper bound on the shortness exponent of inscribable polytopes
- Embedding planar graphs in four pages
- Finding the intersection of two convex polyhedra
- Hamiltonian circuits in random graphs
- Hamiltonian cycles in planar triangulations with no separating triangles
- Parallel concepts in graph theory
- Some properties of the planar Euclidean relative neighbourhood graph
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
Cited in
(5)- Graham triangulations and triangulations with a center are Hamiltonean
- Finding Hamiltonian cycles in certain planar graphs
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- Contractible Hamiltonian cycles in triangulated surfaces
- On hamiltonian triangulations in simple polygons (Extended Abstract)
This page was built for publication: On certain Hamiltonian inner triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367404)
