Premium
On two questions about circular choosability
Author(s) -
Norine Serguei
Publication year - 2008
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20309
Subject(s) - infimum and supremum , mathematics , chromatic scale , combinatorics , graph , friendship graph , critical graph , discrete mathematics , graph power , line graph
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