arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.3594cs.CG
收藏

平面图的泛点集

On Universal Point Sets for Planar Graphs

Jean Cardinal, Michael Hoffmann, Vincent Kusters

摘要:

R^2中的点集P是n-泛点集,如果n阶平面图在P上有一个平面直线嵌入.通过Kobourov的一个问题,我们证明了对于任意n ≥ 15,不存在n-泛点集.相反,我们使用一个计算机程序来证明存在所有n<=10的泛点集,并枚举所有相应的序类型。最后,我们描述了一个由7 '393个35顶点平面图组成的集合G,它不允许同时几何嵌入而不需要映射,也就是说,平面上没有一个35点的集合支持G中所有图的平面直线嵌入。

英文摘要:

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely, we use a computer program to show that there exist universal point sets for all n<=10 and to enumerate all corresponding order types. Finally, we describe a collection G of 7'393 planar graphs on 35 vertices that do not admit a simultaneous geometric embedding without mapping, that is, no set of 35 points in the plane supports a plane straight-line embedding of all graphs in G.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑