CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS*

For a general graph G, M(G) denotes its Mycielski graph. This article gives a number of new sufficient conditions for G to have the circular chromatic number χc(M(G)) equals to the chromatic number χ(M(G)), which have improved some best sufficient conditions published up to date.