e/Domatic number

Information
has gloss	eng: In graph theory, a domatic partition of a graph G = (V,E) is a partition of V into disjoint sets V_1, V_2,...,V_K such that each Vi is a dominating set for G. The figure on the rights shows a domatic partition of a graph; here the dominating set V_1 consists of the yellow vertices, V_2 consists of the green vertices, and V_3 consists of the blue vertices.
lexicalization	eng: domatic number
instance of	c/Computational problems in graph theory

Media
media:img	Domatic-partition.svg
media:img	Weak-2-coloring.svg