The total chromatic number of three special graphs
Xie De-zheng · Journal of Yuzhou University · 2005
The total chromatic number of a graph G is the minimum number of colours needed to colour the edges and the vertices of G so that incident or adjacent elements have distinct colours. We show that three special graphs are type 1.