Decomposition

Decomposition --- разложение, декомпозиция.

A decomposition of a graph [math]\displaystyle{ H }[/math] consists of a set of edge-disjoint subgraphs of [math]\displaystyle{ H }[/math], which partition the edges of [math]\displaystyle{ H }[/math]. If each of the subgraphs in the decomposition is isomorphic to some graph [math]\displaystyle{ G }[/math], then the decomposition is called a [math]\displaystyle{ G }[/math]-decomposition of [math]\displaystyle{ H }[/math], or a decomposition of [math]\displaystyle{ H }[/math] into copies of [math]\displaystyle{ G }[/math].