Hamiltonian Path Problem

computation graph-theory

Definition

Hamiltonian Path Problem

Let $G=(V,E)$ be a graph, directed or undirected. The Hamiltonian path problem is a decision problem asking whether $G$ contains a Hamiltonian path, that is, a path that visits every vertex exactly once.