Total colorings of circulant graphs
The total chromatic number [Formula: see text] is the least number of colors needed to color the vertices and edges of a graph [Formula: see text] such that no incident or adjacent elements (vertices or edges) receive the same color. Behzad and Vizing proposed a well-known total coloring conjecture (TCC): [Formula: see text], where [Formula: see text] is the maximum degree of [Formula: see text]. For the powers of cycles, Campos and de Mello proposed the following conjecture: Let [Formula: see text] denote the graphs of powers of cycles of order [Formula: see text] and length [Formula: see text] with [Formula: see text]. Then, [Formula: see text] In this paper, we prove the Campos and de Mello’s conjecture for some classes of powers of cycles. Also, we prove the TCC for complement of powers of cycles.