论文部分内容阅读
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 xc (M(G))equals to the chromatic number x(M(G)), which have improved some best sufficient conditions published up to date.