The DP-coloring problem, also known as the correspondence coloring problem, is a graph coloring problem invented by Dvořák and Postle that generalizes list coloring. We consider the online and offline versions of the DP-coloring problem, and we show the existence of graphs whose online and offline DP-chromatic numbers have arbitrarily large differences. We also show some new results for the online DP-chromatic number of bipartite graphs. Joint work with Ladislav Stacho and Bojan Mohar.
For Zoom information, please contact Sean at SEnglish (at) illinois (dot) edu.
