Every planar graph is $1$-defective $(9,2)$-paintable

Ming Han, Xuding Zhu

Assume $L$ is a $k$-list assignment of a graph $G$. A $d$-defective $m$-fold $L$-colouring $\varphi$ of $G$ assigns to each vertex $v$ a set $\varphi (v)$ of $m$ colours, so that $ϕ(v) \subsete…