Cycle decomposition (graph theory)
From Wikipedia, the free encyclopedia
For the notation used to express permutations, see Cycle decomposition (group theory).
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.