The dynamic coloring conjecture for planar graphs

Let $G$ be a planar graph, let $r$ be a positive integer, and let $\chi_r^d(G)$ denote the least number of colors in an $r$-dynamic coloring of $G$.

Dynamic coloring conjecture.

$$\chi_r^d(G) \le \begin{cases} r+3 & \text{if }1\le r \le2 \\\ r+5& \text{if }3\le r \le7 \\ \lfloor\frac{3r}{2}\rfloor +1 & \text{if } r \ge8. \\\end{cases}$$

This conjecture concerns the number of colors needed for dynamic colorings of planar graphs and is analogous to conjectures for ordinary colorings of planar graphs. The supplied text does not indicate whether it has been resolved.