Finding Hamiltonian cycles in Delaunay triangulations is NP-complete

AbstractIt is shown that it is an NP-complete problem to determine whether a Delaunay triangulation or an inscribable polyhedron has a Hamiltonian cycle. It is also shown that there exist nondegenerate Delaunay triangulations and simplicial, inscribable polyhedra without 2-factors

Hamiltonian properties of polyhedra with few 3-cuts : a survey

A