论文标题
方形的产品结构
The product structure of squaregraphs
论文作者
论文摘要
方形图是一个平面图,每个内部面为$ 4 $ cycle,每个内部顶点的学位至少为4。我们将此结果概括为无限的方形图,并表明这是最好的,因为“外平面图”不能用“森林”代替。
A squaregraph is a plane graph in which each internal face is a $4$-cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semi-strong product of an outerplanar graph and a path. We generalise this result for infinite squaregraphs, and show that this is best possible in the sense that "outerplanar graph" cannot be replaced by "forest".