两类图的Mycielski图的均匀全色数

设G是简单图，G的点和边称为G的元素。如果G的点和边的染色满足相邻或关联的元素得到不同的颜色，则称为G的正常全染色。如果G的一个正常全染色满足任意两种颜色所染元素数目相差不超过1，则称为G的均匀全染色，其所用量少染色数称为G的均匀全色数。本文确定了轮和扇的Mycielski图的均匀全色数。

Equitable Total Chromatic Number of Mycielski Graphs of Two Classes of Graphs

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.