Geodesic
The tree of cuts and minimal $k$-connected graphs
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part VII, Tome 427 (2014), pp. 22-40

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

A cut of a $k$-connected graph $G$ is its $k$-element cutset which contains at least one edge. The tree of cuts of a set $\mathfrak S$, consisting of pairwise independent cuts of a $k$-connected graph is defined as follows. Its vertices are cuts of the set $\mathfrak S$ and parts of the decomposition of $G$ by the cuts of $\mathfrak S$. A part $A$ is adjacent to a cut $S$ if and only if $A$ contains all vertices of $S$ and one end of each edge of $S$. It is proved that the graph described above is a tree and have properties similar to properties of classic tree of blocks and cutpoints. In the second part of the paper the tree of cuts is applied to study properties of minimal $k$-connected graphs for $k\le5$. 
@article{ZNSL_2014_427_a1,
     author = {D. V. Karpov},
     title = {The tree of cuts and minimal  $k$-connected graphs},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {22--40},
     publisher = {mathdoc},
     volume = {427},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2014_427_a1/}
}
TY  - JOUR
AU  - D. V. Karpov
TI  - The tree of cuts and minimal  $k$-connected graphs
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2014
SP  - 22
EP  - 40
VL  - 427
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2014_427_a1/
LA  - ru
ID  - ZNSL_2014_427_a1
ER  - 
%0 Journal Article
%A D. V. Karpov
%T The tree of cuts and minimal  $k$-connected graphs
%J Zapiski Nauchnykh Seminarov POMI
%D 2014
%P 22-40
%V 427
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2014_427_a1/
%G ru
%F ZNSL_2014_427_a1
D. V. Karpov. The tree of cuts and minimal  $k$-connected graphs. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part VII, Tome 427 (2014), pp. 22-40. http://geodesic.mathdoc.fr/item/ZNSL_2014_427_a1/