The total chromatic number of regular graphs of even order and high degree Original Research Article

The total chromatic number image of a graph image is the minimum number of colours needed to colour the edges and the vertices of image so that incident or adjacent elements have distinct colours. We show that if image is a regular graph of even order and image, thenimage.