Journal of Combinatorics
Volume 8 (2017)
Induced forests in bipartite planar graphs
Pages: 93 – 166
Akiyama and Watanabe conjectured that every simple planar bipartite graph on $n$ vertices contains an induced forest on at least $5n/8$ vertices. We apply the discharging method to show that every simple bipartite planar graph on $n$ vertices contains an induced forest on at least $\lceil (4n + 3)/7 \rceil$ vertices.
induced forest, planar bipartite graph, discharging method
2010 Mathematics Subject Classification
05C05, 05C10, 05C30