These are graphs that contain a Hamiltonian path, which is a path that visits every vertex of the graph exactly once.