Planar graphs without short even cycles are near-bipartite

Runrun Liu, Gexin Yu

A graph is {\em near-bipartite} if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are $3$-colorab…