These are graphs that contain an Eulerian path, which is a path that visits every edge of the graph at least once.