The total chromatic number XT(G) is the least number of colours needed to colour the vertices and edges of a graph G such that no incident or adjacent elements (vertices or edges) receive the same colour. The Total Colouring Conjecture (TCC) states that for every simple graph G. chi T(G) <= Delta 1 (G) + 2. This work verifies the TCC for powers of cycles C-n(k), n even and 2 < k < n/2, showing that there exists and can be polynomially constructed a (Delta (G) + 2)-total colouring for these graphs. (c) 2006 Elsevier B.V. All rights reserved.1555585597