ON A CONJECTURE OF CIRCULAR CHROMATIC NUMBER OF MYCIELSKI GRAPHS

Hongmei Liu · Journal of Mathematics · 2006

In the active research subject of the circular chromatic number of Mycielski graphs,a famous conjecture is that the circular chromatic number of Mycielski graph of complete graphs is equal to its chromatic number.In this paper,based on introducing a special kind of partition of Mycielski graphs and some new concepts, the characters of the circular coloring of Mycielski graphs are analyzed,and are used to make the conjecture progress.

Read the paper · More papers on PaperTik