On generalized choice and coloring numbers
Combinatorics
2019-02-27 v3
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.
Cite
@article{arxiv.1801.06824,
title = {On generalized choice and coloring numbers},
author = {Zdeněk Dvořák and Jakub Pekárek and Jean-Sébastien Sereni},
journal= {arXiv preprint arXiv:1801.06824},
year = {2019}
}
Comments
17 pages, 2 figures