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.
Cite
CITATION STYLE
APA
Richter, R. B. (2004). Decomposing infinite 2-connected graphs into 3-connected components. Electronic Journal of Combinatorics, 11(1 R). https://doi.org/10.37236/1778
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free