出典:Wikipedia
出典:『Wikipedia』 (2011/04/27 01:38 UTC 版)
In graph theory, a domatic partition of a graph G = (V,E) is a partition of V into disjoint sets V1, V2,...,VK such that each Vi is a dominating set for G. The figure on the right shows a domatic partition of a graph; here the dominating set V1 consists of the yellow vertices, V2 consists of the green vertices, and V3 consists of the blue vertices.