On Generalized Choice and Coloring Numbers

  • Zdenēk Dvořák
  • Jakub Pekárek
  • Jean-Sébastien Sereni
DOI: https://doi.org/10.37236/7693

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.

Published
2019-03-22
Issue
Volume 26, Issue 1 (2019)
Article Number
P1.51