On certain Hamiltonian inner triangulations
DOI10.1016/0166-218X(93)90111-ZzbMATH Open0785.05062MaRDI QIDQ2367404FDOQ2367404
Authors: Robert J. Cimikowski 
Publication date: 10 August 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel concepts in graph theory
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
- Embedding planar graphs in four pages
- Hamiltonian circuits in random graphs
- Title not available (Why is that?)
- Hamiltonian cycles in planar triangulations with no separating triangles
- Finding the intersection of two convex polyhedra
- Title not available (Why is that?)
- A non-Hamiltonian, nondegenerate Delaunay triangulation
- An upper bound on the shortness exponent of inscribable polytopes
- Some properties of the planar Euclidean relative neighbourhood graph
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)
