Decomposable graph

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

Decomposable graph --- разложимый граф.

We write G = H_{1} \oplus H_{2} if G is the edge disjoint union of its subgraphs H_{1} and H_{2}. If G = H_{1} \oplus \cdots \oplus
H_{k}, where H_{1}, \ldots, H_{k} are all isomorphic to H, then G can be decomposed into subgraphs isomorphic to H; we say that G is H-decomposable and that \{H_{1}, \ldots, H_{k}\} is H-decomposition of G. In particular, G is C_{m}-decomposable if it can be decomposed into subgraphs isomorphic to an m-cycle.