On Generalized Choice and Coloring Numbers

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.

Saved in:
Bibliographic Details
Published in:The Electronic journal of combinatorics 2019-03, Vol.26 (1)
Main Authors: Dvořák, Zdenēk, Pekárek, Jakub, Sereni, Jean-Sébastien
Format: Article
Language:English
Subjects:
Combinatorics
Mathematics
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1077-8926
1077-8926
DOI:10.37236/7693