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.
@article{10_37236_7693,
author = {Zden\={e}k Dvo\v{r}\'ak and Jakub Pek\'arek and Jean-S\'ebastien Sereni},
title = {On generalized choice and coloring numbers},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {1},
doi = {10.37236/7693},
zbl = {1409.05084},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7693/}
}
TY - JOUR
AU - Zdenēk Dvořák
AU - Jakub Pekárek
AU - Jean-Sébastien Sereni
TI - On generalized choice and coloring numbers
JO - The electronic journal of combinatorics
PY - 2019
VL - 26
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/7693/
DO - 10.37236/7693
ID - 10_37236_7693
ER -
%0 Journal Article
%A Zdenēk Dvořák
%A Jakub Pekárek
%A Jean-Sébastien Sereni
%T On generalized choice and coloring numbers
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/7693/
%R 10.37236/7693
%F 10_37236_7693
Zdenēk Dvořák; Jakub Pekárek; Jean-Sébastien Sereni. On generalized choice and coloring numbers. The electronic journal of combinatorics, Tome 26 (2019) no. 1. doi: 10.37236/7693