Let $G$ be a graph. A path on $G$ that includes every vertex exactly once is called a Hamiltonian path.