当前位置: X-MOL 学术arXiv.cs.DM › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
1-planar graphs with minimum degree at least 3 have bounded girth
arXiv - CS - Discrete Mathematics Pub Date : 2020-01-15 , DOI: arxiv-2001.05402
Fran\c{c}ois Dross

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$.

中文翻译:

最小度数至少为 3 的 1 平面图具有有界周长

我们表明,每个最小度数至少为 4 的 1-平面图的周长最多为 $8$,而每个最小度数至少为 3 的 1-平面图的周长最多为 $198$。
更新日期:2020-01-17
down
wechat
bug