Planar graphs without short even cycles are near-bipartite

@article{Liu2020PlanarGW,
title={Planar graphs without short even cycles are near-bipartite},
author={Runrun Liu and Gexin Yu},
journal={Discret. Appl. Math.},
year={2020},
volume={284},
pages={626-630}
}

: 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 4 to 7 are shown… Expand

In this paper, we show that every planar graph without 4-cycles and 6-cycles has a partition of its vertex set into two sets, where one set induces a forest, and the other induces a forest with… Expand

We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces… Expand