Equitable Coloring of Mycielskian of Some Graphs

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph µ(G), we now call the Myciel-skian of G, which has the same clique number as G and whose chro-matic number equals χ(G) + 1. This paper presents exact values of the equitable chromatic number χ= for the Mycielski’s graph of complete graphs µ(Kn), the Mycielski’s graph of cycles µ(Cn), the Mycielski’s graph of paths µ(Pn), the Mycielski’s graph of Helm graphs µ(Hn) and the Mycielski’s graph of Gear graphs µ(Gn)