论文标题
将无三角形的平面图分解为森林和亚皮比奇森林
Decomposing a triangle-free planar graph into a forest and a subcubic forest
论文作者
论文摘要
我们加强了Dross，Montassier和Pinlou（2017）的结果，即每个无三角形平面图的顶点集可以分解为一组，该集合可以诱发森林和最高$ 5 $的森林，这表明$ 5 $可以替换为$ 3 $ $ 3 $。
We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set that induces a forest with maximum degree at most $5$, showing that $5$ can be replaced by $3$.
