Decomposing Infinite 2-Connected Graphs into 3-Connected Components
Abstract
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.
Published
2004-03-25
How to Cite
Richter, R. B. (2004). Decomposing Infinite 2-Connected Graphs into 3-Connected Components. The Electronic Journal of Combinatorics, 11(1), R25. https://doi.org/10.37236/1778
Article Number
R25