2. A Hamiltonian cycle in a graph G is a path which visits each v...