2 research outputs found
On generalized choice and coloring numbers
A well-known result of Alon shows that the coloring number of a graph is
bounded by a function of its choosability. We explore this relationship in a
more general setting with relaxed assumptions on color classes, encoded by a
graph parameter.Comment: 17 pages, 2 figure
Generalized list colouring of graphs
This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in
negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open
problems.Comment: 6 page