Sciweavers

Share
COMBINATORICS
2004

Decomposing Infinite 2-Connected Graphs into 3-Connected Components

8 years 11 months ago
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.
R. Bruce Richter
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where COMBINATORICS
Authors R. Bruce Richter
Comments (0)
books