Let $G$ be a graph. If there is a cycle visiting all vertices of $G$ exactly once, we say that the cycle is a Hamiltonian cycle. A graph having a Hamiltonian cycle is called a Hamiltonian graph.