论文标题
没有4到7的长度的平面图是近两分的
Planar graphs without cycles of length from 4 to 7 are near-bipartite
论文作者
论文摘要
如果可以将其顶点集分为独立的集合和诱导森林的集合，则图将接近两分。在本文中，没有长度为4到7的平面图显示为接近两分。
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 to be near-bipartite.
