论文标题
1平面图至少至少3个有界限
1-planar graphs with minimum degree at least 3 have bounded girth
论文作者
论文摘要
我们表明，每一个具有最低学位至少4个的1平面图最多有$ 8 $，并且每1个具有最低学位的1个平面图至少3张最多$ 198 $。
We show that every 1-planar graph with minimum degree at least 4 has girth at most $8$, and every 1-planar graph with minimum degree at least 3 has girth at most $198$.
