平面树填充定理
The Planar Tree Packing Theorem
摘要:
包装图是一个组合问题,其中几个给定的图被映射到一个共同的主机图,使得每个边最多使用一次。在平面树填充问题中,我们给出了两棵树T1和T2的n个顶点,并且必须找到一个平面图,该平面图是T1和T2的边不交并。一个明显的例外是不能与任何其他树挤在一起的星星。但根据García等人1997年的猜想,这是唯一的例外,所有其他的树对都允许平面填充。以前的结果解决了各种特殊的情况下,如树和蜘蛛树,树和毛虫,两棵树的直径为4,两个同构的树,树的最大程度为3。这里我们肯定地解决了这个猜想,并证明了它的一般形式,从而使它成为平面树填充定理。证明是建设性的,并提供了一个多项式时间算法,以获得包装的两个给定的非星树。
英文摘要:
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and have to find a planar graph on n vertices that is the edge-disjoint union of T1 and T2. A clear exception that must be made is the star which cannot be packed together with any other tree. But according to a conjecture of García et al. from 1997 this is the only exception, and all other pairs of trees admit a planar packing. Previous results addressed various special cases, such as a tree and a spider tree, a tree and a caterpillar, two trees of diameter four, two isomorphic trees, and trees of maximum degree three. Here we settle the conjecture in the affirmative and prove its general form, thus making it the planar tree packing theorem. The proof is constructive and provides a polynomial time algorithm to obtain a packing for two given nonstar trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。