论文标题
飞机三角剖分没有跨越2个树
Plane Triangulations Without Spanning 2-Trees
论文作者
论文摘要
2树是一个图形，可以从三角形开始，并迭代使新顶点与现有图的两个相邻顶点相邻的操作。 Leizhen Cai在1995年询问每个最大平面图是否包含一个跨越2树。我们通过构建没有跨越2个树的无限最大平面图来回答这个问题。
A 2-tree is a graph that can be formed by starting with a triangle and iterating the operation of making a new vertex adjacent to two adjacent vertices of the existing graph. Leizhen Cai asked in 1995 whether every maximal planar graph contains a spanning 2-tree. We answer this question in the negative by constructing an infinite class of maximal planar graphs that have no spanning 2-tree.
