Wu–Zhang–Li equitable vertex arboricity conjecture

Let $G$ be a graph. A vertex $k$-arborable graph has a (not necessarily proper) $k$-coloring whose color classes induce acyclic subgraphs; it is equitably vertex $k$-arborable if the sizes of the color classes differ by at most one. Let $\Delta(G)$ denote the maximum degree.

Wu–Zhang–Li conjecture. Graph $G$ is equitably vertex $k$-arborable whenever

$$k\geq \left\lceil\frac{\Delta(G)+1}{2}\right\rceil.$$

The conjecture is a well-known equitable analogue of vertex arboricity and has received attention in the literature; the supplied text does not state a resolution.