3维格P_(n1)×P_(n2)×P_(n3)和台阶图的控制满划分

DOMATIC FULL PARTITIONS OF 3-DIMENSIONAL GRID P_(n1)×P_(n2)×P_(n3)AND STEP GRAPHS

通过给出3维格P_(n1)×P_(n2)×P_(n3)和台阶图S^((m))_(n_1、n_2、n_3)的控制满划分，证明了控制划分数d（P_(n1)×P_(n2)×P_(n3)）=4，d（SS^((m))_(n_1、n_2、n_3)）=4（其中ni≥2，i=1，2，3；m≥1）.

Domatic full partitions of P_(n1)×P_(n2)×P_(n3) and so-called step graphs are produced in the paper and they are all directly proved to be domatically full.