×

zbMATH — the first resource for mathematics

Decomposing infinite 2-connected graphs into 3-connected components. (English) Zbl 1058.05053
Electron. J. Comb. 11, No. 1, Research paper R25, 10 p. (2004); printed version J. Comb. 11, No. 1 (2004).
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.

MSC:
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C40 Connectivity
PDF BibTeX XML Cite
Full Text: EuDML EMIS