关于图的同时嵌入
On Simultaneous Graph Embedding
摘要:
考虑平面图的同时嵌入问题。这个问题有两种变体,一种是两个图的顶点之间的映射是给定的,另一种是映射是不给定的。特别是,我们表明,没有映射,任何数量的outerplanar图可以同时嵌入在一个$O(n)\times O(n)$网格,和outerplanar和一般平面图可以同时嵌入在一个$O(n^2)\times O(n^3)$网格。如果映射是给定的,我们将展示如何嵌入两个路径上的$n \times n$网格,一个毛虫和路径上的$n \times 2n$网格,或两个毛虫图上的$O(n^2)\times O(n^3)$网格。我们还表明,5条道路,或3毛虫,或两个一般的平面图不能同时嵌入给定的映射。
英文摘要:
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another where the mapping is not given. In particular, we show that without mapping, any number of outerplanar graphs can be embedded simultaneously on an $O(n)\times O(n)$ grid, and an outerplanar and general planar graph can be embedded simultaneously on an $O(n^2)\times O(n^3)$ grid. If the mapping is given, we show how to embed two paths on an $n \times n$ grid, a caterpillar and a path on an $n \times 2n$ grid, or two caterpillar graphs on an $O(n^2)\times O(n^3)$ grid. We also show that 5 paths, or 3 caterpillars, or two general planar graphs cannot be simultaneously embedded given the mapping.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。