CIRCULAR CHROMATIC NUMBER FOR MYCIELSKI GRAPHS
Hongmei Liu · Journal of Mathematics · 2006
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.