On generalized choice and coloring numbers
Résumé
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]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...