The structure of decomposition of a~triconnected graph
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part III, Tome 391 (2011), pp. 90-148

Voir la notice de l'article provenant de la source Math-Net.Ru

We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of all complexes is presented. Moreover, we prove that the structure of a hypertree could be introduced on the set of all complexes. This structure gives us a complete description of the relative disposition of the complexes.
@article{ZNSL_2011_391_a5,
     author = {D. V. Karpov and A. V. Pastor},
     title = {The structure of decomposition of a~triconnected graph},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {90--148},
     publisher = {mathdoc},
     volume = {391},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2011_391_a5/}
}
TY  - JOUR
AU  - D. V. Karpov
AU  - A. V. Pastor
TI  - The structure of decomposition of a~triconnected graph
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2011
SP  - 90
EP  - 148
VL  - 391
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2011_391_a5/
LA  - ru
ID  - ZNSL_2011_391_a5
ER  - 
%0 Journal Article
%A D. V. Karpov
%A A. V. Pastor
%T The structure of decomposition of a~triconnected graph
%J Zapiski Nauchnykh Seminarov POMI
%D 2011
%P 90-148
%V 391
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2011_391_a5/
%G ru
%F ZNSL_2011_391_a5
D. V. Karpov; A. V. Pastor. The structure of decomposition of a~triconnected graph. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part III, Tome 391 (2011), pp. 90-148. http://geodesic.mathdoc.fr/item/ZNSL_2011_391_a5/