Akiyama–Watanabe and Albertson–Rhaas conjecture for bipartite planar graphs

Let $G$ be a bipartite planar graph of order $n$. An induced forest of $G$ is a vertex-induced subgraph that is acyclic. Akiyama–Watanabe and Albertson–Rhaas conjecture. Every bipartite planar graph of order $n$ admits an induced forest of order at least $\frac{5n}{8}$. This conjecture strengthens the general planar-graph bound for the bipartite subclass; the paper records it as an independently proposed open question.