可平面图与覆盖
Planar graphs and covers
摘要：
讨论了几乎点传递的平面局部有限图。如果图是3-连通的且至多有一端，则自同构的自同构群是平面不连续群，其结构是已知的。对于端点数不受限制的图，得到了一个一般性的结果。结果表明，这样的图可以由一端图或有限个可平面图以精确的方式建立起来。结果给出了平面Cayley图的有限生成群的一个分类.
英文摘要：
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general result is obtained for such graphs where no restriction is put on the number of ends. It is shown that such a graph can be built up from one ended or finite planar graphs in a precise way. The results give a classification of the finitely generated groups with planar Cayley graphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
