On domatic and total domatic numbers of Cartesian products of graphs (Q6102218)

A domatic \(k\)-coloring of a simple, undirected graph \(G\) is an assignment of \(k\) colors to the vertices of \(G\) such that each vertex contains vertices of all \(k\) colors in its closed neighborhood. The domatic number of \(G\), denoted \(d(G)\), is the maximum \(k\) for which \(G\) has a domatic \(k\)-coloring. A total domatic \(k\)-coloring is an assignment of \(k\) colors to the vertices of \(G\) such that each vertex contains vertices of all \(k\) colors in its open neighborhood. The total domatic number of \(G\), denoted \(d_t (G)\), is the maximum \(k\) for which \(G\) has a total domatic \(k\)-coloring. The authors of this paper obtain some lower and upper bounds for these coloring parameters for the Cartesian product of graphs and for Hamming graphs of certain dimensions. They also obtain exact values for the domatic and total domatic number for some \(n\)-dimensional tori and list some open problems for researchers in this area.