Geodesic
Decomposing infinite 2-connected graphs into 3-connected components
The electronic journal of combinatorics, Tome 11 (2004) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1778
Classification : 05C70, 05C40
Mots-clés : connectivity, decomposition, infinite planar graphs 
@article{10_37236_1778,
     author = {R. Bruce Richter},
     title = {Decomposing infinite 2-connected graphs into 3-connected components},
     journal = {The electronic journal of combinatorics},
     year = {2004},
     volume = {11},
     number = {1},
     doi = {10.37236/1778},
     zbl = {1058.05053},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1778/}
}
TY  - JOUR
AU  - R. Bruce Richter
TI  - Decomposing infinite 2-connected graphs into 3-connected components
JO  - The electronic journal of combinatorics
PY  - 2004
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1778/
DO  - 10.37236/1778
ID  - 10_37236_1778
ER  - 
%0 Journal Article
%A R. Bruce Richter
%T Decomposing infinite 2-connected graphs into 3-connected components
%J The electronic journal of combinatorics
%D 2004
%V 11
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1778/
%R 10.37236/1778
%F 10_37236_1778
R. Bruce Richter. Decomposing infinite 2-connected graphs into 3-connected components. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1778

Cité par Sources :