Abstract:

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 $\chi_c(M(G))$ equals to the chromatic number $\chi(M(G))$,
which have improved some best sufficient conditions published up to date.

Key words: Circular chromatic number, Mycielski graphs, chromatic number