Circular chromatic number and Mycielski construction
Hossein Hajiabolhassan, Xuding Zhu · Journal of Graph Theory · 2003
Abstract This paper gives a sufficient condition for a graph G to have its circular chromatic number equal to its chromatic number. By using this result, we prove that for any integer t ≥ 1, there exists an integer n such that for all $k \ge n, \chi _c (M^t(K_k))\,= \chi(M^t(K_k))$ . © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 106–115, 2003