Decomposing Infinite 2-Connected Graphs into 3-Connected Components
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
复制标题
将无限 2 连通图分解为 3 连通分量
DOI：
10.37236/1778
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
R. Richter
中科院分区：
文献类型：
--
作者：
R. Richter
在20世纪60年代，Tutte提出了将2连通有限图分解为3连通图、环和键的方法。这种分解已被用于将2连通图上的问题简化为3连通图上的问题。基于一个关于无限平面图的累加点问题，我们将Tutte分解推广到包括所有无限2连通图。
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on 2-connected graphs to problems on 3-connected graphs. Motivated by a problem concerning accumulation points of infinite planar graphs, we generalize Tutte's decomposition to include all infinite 2-connected graphs.