Equitable Total Chromatic Number of Mycielski Graphs of Two Classes of Graphs
Liang Sun · Keji daobao · 2005
Let G be a simple graph. The vertices and edges of G are called the elements of G. For a coloring of the elements of G, if any two adjacent or incident elements of G have different colors, then it is called the proper total coloring of G. The equitable total coloring of a graph G is the proper total coloring such that the numbers of elements in any two color classes differ by at most one. The equitable total chromatic number is the smallest integer k such that G has an equitable total k-coloring. In this paper, we determine the equitable total chromatic number of Mycielski graphs of wheels and fans.