Cycle decomposition

From Wikipedia, the free encyclopedia

A cycle decomposition in mathematics may refer to one of two related concepts.

• In graph theory, a cycle decomposition is a partitioning of the vertices of a graph into subsets, such that the vertices in each subset lie on a cycle.

• In combinatorics, a cycle decomposition is a way of writing a permutation as a number of disjoint cycles.