Induced Forests in Bipartite Planar Graphs
Combinatorics
2016-05-03 v1
Abstract
Akiyama and Watanabe conjectured that every simple planar bipartite graph on vertices contains an induced forest on at least vertices. We apply the discharging method to show that every simple bipartite planar graph on vertices contains an induced forest on at least vertices.
Cite
@article{arxiv.1605.00047,
title = {Induced Forests in Bipartite Planar Graphs},
author = {Yan Wang and Qiqin Xie and Xingxing Yu},
journal= {arXiv preprint arXiv:1605.00047},
year = {2016}
}