what is the difference between a cycle and a hamiltonian cycle?
Definition 5.3. 1 A cycle that uses every vertex in a graph exactly once is called a Hamilton cycle, and a path that uses every vertex in a graph exactly once is called a Hamilton path. ... 1 shows graphs with just a few more edges than the cycle on the same number of vertices, but without Hamilton cycles.