Geodesic
The structure of locally finite two-connected graphs
The electronic journal of combinatorics, Tome 2 (1995)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We expand on Tutte's theory of $3$-blocks for $2$-connected graphs, generalizing it to apply to infinite, locally finite graphs, and giving necessary and sufficient conditions for a labeled tree to be the $3$-block tree of a $2$-connected graph.
DOI : 10.37236/1211
Classification : 05C40, 05C05
Mots-clés : two-connected graphs, locally finite graphs, labeled tree 
@article{10_37236_1211,
     author = {Carl Droms and Brigitte Servatius and Herman Servatius},
     title = {The structure of locally finite two-connected graphs},
     journal = {The electronic journal of combinatorics},
     year = {1995},
     volume = {2},
     doi = {10.37236/1211},
     zbl = {0829.05041},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1211/}
}
TY  - JOUR
AU  - Carl Droms
AU  - Brigitte Servatius
AU  - Herman Servatius
TI  - The structure of locally finite two-connected graphs
JO  - The electronic journal of combinatorics
PY  - 1995
VL  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1211/
DO  - 10.37236/1211
ID  - 10_37236_1211
ER  - 
%0 Journal Article
%A Carl Droms
%A Brigitte Servatius
%A Herman Servatius
%T The structure of locally finite two-connected graphs
%J The electronic journal of combinatorics
%D 1995
%V 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1211/
%R 10.37236/1211
%F 10_37236_1211
Carl Droms; Brigitte Servatius; Herman Servatius. The structure of locally finite two-connected graphs. The electronic journal of combinatorics, Tome 2 (1995). doi: 10.37236/1211

Cité par Sources :