Decomposing infinite 2-connected graphs into 3-connected components (Q1883635)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposing infinite 2-connected graphs into 3-connected components |
scientific article; zbMATH DE number 2107467
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing infinite 2-connected graphs into 3-connected components |
scientific article; zbMATH DE number 2107467 |
Statements
Decomposing infinite 2-connected graphs into 3-connected components (English)
0 references
13 October 2004
0 references
Summary: 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.
0 references
connectivity
0 references
decomposition
0 references
infinite planar graphs
0 references
