Decomposing Infinite 2-Connected Graphs into 3-Connected Components

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.

• Type: Journal
• Year: 2004
• Where: COMBINATORICS
• Authors: R. Bruce Richter
• Keywords: 2-connected Finite Graph, 3-connected Graphs, COMBINATORICS 2004, Decomposition