Induced Forests in Bipartite Planar Graphs
Wang, Yan · Xie, Qiqin · Yu, Xingxing
Original · EN
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 (4n+3)/7 vertices.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.