On generalized choice and coloring numbers
classification
🧮 math.CO
keywords
coloringgraphalonassumptionsboundedchoicechoosabilityclasses
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.