Total coloring of regular graphs of girth = degree + 1

Abstract

Let $2\le k\in\mathbb{Z}$. A total coloring of a $k$-regular simple graph via $k+1$ colors is an {\it efficient total coloring} if each color yields an efficient dominating set, where the efficient domination condition applies to the restriction of each color class to the vertex set. In this work, focus is set upon graphs of girth $k+1$. Efficient total colorings of finite connected simple cubic graphs of girth 4 are constructed starting at the 3-cube. It is conjectured that all of them are obtained by means of four basic operations. In contrast, the Robertson 19-vertex $(4,5)$-cage, the alternate union $Pet^k$ of a (Hamilton) $10k$-cycle with $k$ pentagon and $k$-pentagram $5$-cycles, for $k>1$ not divisible by 5, and its double cover $Dod^k$, contain TCs that are nonefficient. Applications to partitions into 3-paths and 3-stars are given.