Finding Hamiltonian cycles in certain planar graphs
From MaRDI portal
Publication:916416
DOI10.1016/0020-0190(90)90053-ZzbMath0703.68079MaRDI QIDQ916416
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
A linear time recognition algorithm for proper interval graphs, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Small Point Sets for Simply-Nested Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding planar graphs in four pages
- An upper bound on the shortness exponent of inscribable polytopes
- 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