A Hamiltonian cycle visits every vertex exactly once and returns to the start. Watch backtracking search find (or fail to find) one — NP-complete in general.