Gen Kawatani

The domatic number [Formula: see text] of a graph [Formula: see text] is the maximum number of disjoint dominating sets in a dominating set partition of a graph [Formula: see text]. For any graph [Formula: see text], [Formula: see text] where [Formula: see text] is the minimum degree of [Formula: see text], and [Formula: see text] is domatically full if the equality holds, i.e., [Formula: see text]. In this paper, we characterize domatically full Cartesian products of a path of order 2 and a tree of order at least 3. Moreover, we show a characterization of the Cartesian product of a longer path and a tree of order at least 3. By using these results, we also show that for any two trees of order at least 3, the Cartesian product of them is domatically full.