On two questions about circular choosability
Serguei Norine · Journal of Graph Theory · 2008
Abstract We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a graph for which the infimum in the definition of the circular list chromatic number is not attained. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:261‐269, 2008