Total Colorings of Some Classes of FourRegular Circulant Graphs

R. Navaneeth, J. Geetha, K. Somasundaram +1

The total chromatic number, $\ddot{I}{‡}^{\prime \prime }(G)$ is the minimum number of colors which need to be assigned to obtain a total coloring of the graph $G$. The Total Coloring Conjecture (TCC) mad…