Raspaud–Wang conjecture on partitioning triangle-free planar graphs

Let $G$ be a finite simple triangle-free planar graph. A partition of $G$ into an independent set and a forest means that there is a partition $(V_1,V_2)$ of $V(G)$ such that $G[V_1]$ is independent and $G[V_2]$ is a forest. Raspaud–Wang conjecture. Every triangle-free planar graph can be partitioned into an independent set and a forest. This would strengthen the known partition of triangle-free planar graphs into two forests; the conjecture is also independently attributed to Kawarabayashi and Thomassen in the surrounding discussion, while the paper presents it as an earlier conjecture of Raspaud and Wang.