On list 3-dynamic coloring of near-triangulations

Ruijuan Gu, Seog-Jin Kim, Yulai Ma +1

An $r$-dynamic $k$-coloring of a graph $G$ is a proper $k$-coloring such that for any vertex $v$, there are at least $\min \{r,de{g}_G(v)\}$ distinct colors in $N_G(v)$. The $r$-dyn…