1 paper
Lili Hao, Weihua Yang, Shuang Zhao
A graph is near-bipartite if its vertex set can be partitioned into an independent set and a set which induces a forest. In this paper, planar graphs without cycles of length from…