  The total chromatic number, $\chi''(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) made independently by Behzad and Vizing that for any
graph, $\chi''(G) \leq \Delta(G)+2 $, where $\Delta(G)$ represents the maximum
degree of $G$. In this paper we obtained the total chromatic number for some
classes of four regular circulant graphs.
