中文摘要：

通过引入一类点集划分的概念，研究了Mylielski图循环染色的性质，证明了当完全图的点数足够大时，它的Myclelskl图的循环色数与其点色数相等．

英文摘要：

In this paper, based on introducing a special kind of partition of the vertex set of Mycielski graphs and some new concepts, the characters of the circular coloring of Mycielski graphs are analyzed. These characters are then employed to show that the circular chromatic number of Mycielski graph of complete graphs equals to its chromatic number when the order of complete graph is big enough.