On generalized choice and coloring numbers *

Zdeněk Dvořák (1) , Jakub Pekárek (2) , Jean-Sébastien Sereni (3)

1 IUUK - Computer Science Institute of Charles University [Prague]
2 IUUK - Informatický Ústav Univerzity Karlovy
3 CNRS - Centre National de la Recherche Scientifique

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.

Domaines: Combinatoire [math.CO]

Zdeněk Dvořák, Jakub Pekárek, Jean-Sébastien Sereni. On generalized choice and coloring numbers *. 2018. ⟨hal-01689209v2⟩