Cycle decomposition (graph theory)

A cycle decomposition of a graph. The edges are partitioned into two sets (blue and orange) where each set forms a cycle.

In graph theory, a cycle decomposition is a decomposition (a partitioning of a graph's edges) into cycles. Every vertex in a graph that has a cycle decomposition must have even degree.