e/Hamiltonian completion

Information
has gloss	eng: The Hamiltonian completion problem is to find the minimal number of edges to add to a graph to make it Hamiltonian.
lexicalization	eng: Hamiltonian completion
instance of	e/NP-complete