What do we know about covering the edges of a graph by disjoint paths?
You can cover the edges of a graph by cycles iff the graph is Eulerian (or has multiple Eulerian components). Notice that two cycles that share a vertex can always be combined into one cycle.