Abstract
This paper proves that for any integer $n\geq 4$ and any rational number $r$, $2\leq r\leq n-2$, there exists a graph $G$ which has circular chromatic number $r$ and which does not contain $K_n$ as a minor.
Citation
Xuding Zhu. "CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS." Taiwanese J. Math. 4 (4) 643 - 660, 2000. https://doi.org/10.11650/twjm/1500407298
Information