Total Colorings of Circulant Graphs

The total chromatic number χ″(G) is the least number of colors needed to color the vertices and edges of a graph G such that no incident or adjacent elements (vertices or edges) receive the same co...