A cycle that visits every vertex of a graph exactly once is a:
Euler circuit
Spanning tree
Bipartite cycle
Hamiltonian cycle