Which property is true for all Hamiltonian graphs?
They are Eulerian.
They contain a cycle that visits every vertex.
They must have an even number of vertices.
They must be complete graphs.