English Hamiltonian completion Cited by user David Eppstein on 06 Feb 2024 The Hamiltonian completion problem is to find the minimal number of edges to add to a graph to make it Hamiltonian.