Wu, Zhang, and Li's equitable induced-forest partition conjecture for planar graphs

Let $G$ be a planar graph. An equitable partition of $G$ is a partition of its vertex set into parts whose sizes differ by at most one, and an induced forest is a vertex-induced subgraph that is a forest. Wu, Zhang, and Li's conjecture. There is a constant $c$ such that, for every integer $k\geqslant c$, every planar graph can be equitably partitioned into $k$ induced forests. The conjecture concerns equitable coloring by induced forests; the cited paper proves that such a constant exists, so the claim is resolved.