Defective 3-Paintability of Planar Graphs

Grzegorz Gutowski, Ming Han, Tomasz Krawczyk +1

A $d$-defective $k$-painting game on a graph $G$ is played by two players: Lister and Painter. Initially, each vertex is uncolored and has $k$ tokens. In each round, Lister marks a…