3-dynamic coloring of planar triangulations

An $r$-dynamic $k$-coloring of a graph $G$ is a proper $k$-coloring such that any vertex $v$ has at least $min\{r,{deg}_G\left(v\right)\}$ distinct colors in $N_G\left(v\right)$. The $r$-dynamic chromatic number${\chi }_r^d\left(G\right)$ of a graph $G$ is the least $k$ such that there exists an $r$-dynamic $k$-coloring of $G$.Loeb et al. (2018) showed that if $G$ is a planar graph, then ${\chi }_3^d\left(G\right)\le 10$, and there is a planar graph $G$ with ${\chi }_3^d\left(G\right)=7$. Thus, finding an optimal upper bound on ${\chi }_3^d\left(G\right)$ for a planar graph $G$ is a natural interesting problem. In this paper, we show that ${\chi }_3^d\left(G\right)\le 5$ if $G$ is a planar triangulation. The upper bound is sharp.