On generalized choice and coloring numbers
arXiv:1801.06824
Abstract
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.
17 pages, 2 figures