Decomposing infinite 2-connected graphs into 3-connected components.
Richter, R. Bruce
The Electronic Journal of Combinatorics [electronic only], Tome 11 (2004), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2004-01-01
EUDML-ID : urn:eudml:doc:124309 
@article{02107467,
     title = {Decomposing infinite 2-connected graphs into 3-connected components.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {11},
     year = {2004},
     zbl = {1058.05053},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02107467}
}

Richter, R. Bruce. Decomposing infinite 2-connected graphs into 3-connected components.. The Electronic Journal of Combinatorics [electronic only], Tome 11 (2004) . http://gdmltest.u-ga.fr/item/02107467/