On two questions about circular choosability

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.

• Type: Journal
• Year: 2008
• Where: JGT
• Authors: Serguei Norine
• Keywords: Circular Choosability, Circular List, JGT 2008, List Chromatic Number