Veblen’s theoremThe edge set of a graph can be partitioned (http://planetmath.org/Partition) into cycles if and only if every vertex has even degree.