Domatic number
(重定向自Domatic partition)
In graph theory, a domatic partition of a graph is a partition of
into disjoint sets
,
,...,
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
consists of the yellow vertices,
consists of the green vertices, and
consists of the blue vertices.