On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502)

The authors consider total colorings of graphs, that is the mappings assigning a color to every edge and every vertex of a graph. Such coloring is \(D(2)\)-vertex distinguishing if it is proper and for every pair of vertices at distance \(2\) their sets of colors are distinct. It is proved in the paper that in the case of graphs satisfying \(\Delta(G)\leq 3\) it is enough to use \(11\) colors to obtain a \(D(2)\)-vertex distinguishing coloring.