Hamiltonian problem

Hamiltonian problem

(computability)
(Or "Hamilton's problem") A problem in graph theory posed by William Hamilton: given a graph, is there a path through the graph which visits each vertex precisely once (a "Hamiltonian path")? Is there a Hamiltonian path which ends up where it started (a "Hamiltonian cycle" or "Hamiltonian tour")?

Hamilton's problem is NP-complete. It has numerous applications, sometimes completely unexpected, in computing.

http://ing.unlp.edu.ar/cetad/mos/Hamilton.html.
References in periodicals archive ?
It turns out that the Hamiltonian problem of the hydrogen atom of a Dirac particle is discussed adequately in relevant textbooks [8,14].
BURRAGE, Low rank Runge-Kutta methods, symplecticity and stochastic Hamiltonian problems with additive noise, J.
Chan and Murua [4] found out that the global errors of the solutions of periodic and integrable Hamiltonian problems grow linearly when solved by extrapolated symplectic or symmetric methods.