Материал из WikiGrapp
Перейти к:навигация, поиск

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

A decomposition of a graph H consists of a set of edge-disjoint subgraphs of H, which partition the edges of H. If each of the subgraphs in the decomposition is isomorphic to some graph G, then the decomposition is called a G-decomposition of H, or a decomposition of H into copies of G.