The Slow-coloring Game on Sparse Graphs: $k$-Degenerate, Planar, and Outerplanar

Grzegorz Gutowski, Tomasz Krawczyk, Krzysztof Maziarz +3

The \emph{slow-coloring game} is played by Lister and Painter on a graph $G$. Initially, all vertices of $G$ are uncolored. In each round, Lister marks a nonempty set $M$ of uncolo…