Separating the online and offline DP-chromatic numbers
The electronic journal of combinatorics, Tome 30 (2023) no. 4
The DP-coloring problem is a generalization of the list-coloring problem in which the goal is to find an independent transversal in a certain topological cover of a graph $G$. In the online DP-coloring problem, the cover of $G$ is revealed one component at a time, and the independent transversal of the cover must be constructed in parts based on incomplete information. Kim, Kostochka, Li, and Zhu asked whether the chromatic numbers corresponding to these two graph coloring problems can have an arbitrarily large difference in a single graph. We answer this question in the affirmative by constructing graphs for which the gap between the online DP-chromatic number and the offline DP-chromatic number is arbitrarily large.
DOI :
10.37236/11548
Classification :
05C15
Mots-clés : DP-coloring problem, list-coloring problem
Mots-clés : DP-coloring problem, list-coloring problem
Affiliations des auteurs :
Peter Bradshaw  1
@article{10_37236_11548,
author = {Peter Bradshaw},
title = {Separating the online and offline {DP-chromatic} numbers},
journal = {The electronic journal of combinatorics},
year = {2023},
volume = {30},
number = {4},
doi = {10.37236/11548},
zbl = {1532.05062},
url = {http://geodesic.mathdoc.fr/articles/10.37236/11548/}
}
Peter Bradshaw. Separating the online and offline DP-chromatic numbers. The electronic journal of combinatorics, Tome 30 (2023) no. 4. doi: 10.37236/11548
Cité par Sources :