Before revision:  The corresponding decision problem, that asks whether a given graph is Hamiltonian (i. e. admits a Hamiltonian cycle), is one of Karp's famous NP-complete problems.
After revision:  The corresponding decision problem, that asks whether a given graph is Hamiltonian (i. \,e.\ admits a Hamiltonian cycle), is one of Karp's famous NP-complete problems.