ON THE STAR TOTAL CHROMATIC NUMBER OF MYCIELSKI GRAPHS OF PATH AND CYCLE
Jinwen Li, Muchun Li, Baogeng Xu, Ting Zhang, Ergeng Liu · 2007
A proper total k-coloring of a graph G is a star total k-coloring if the colorings of vertices and edges of any path of length 3 in G are all different. The least number of k spanning over all star total k-colorings of G, denoted byst(G), is called the star total chromatic number of G. In this paper, we obtained the star total chromatic numbers of Mycielski of path and cycle graphs.