A simple proof of Moser's theorem
Xuding Zhu · Journal of Graph Theory · 1999
This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 19–26, 1999