Steklov Institute of Mathematics at St.Petersburg

PREPRINT 18/2003

Структура разбиения слабо нерасщепимого $k$-связного графа

This preprint was accepted Ноябрь 10, 2003

ABSTRACT:
We study a structure  of decomposition of a $k$-connected graph
by a collection of several $k$-vertex cuts.
We describe a tree showing a structure of $k$-cuts of the full
collection of $k$-cuts $\mathfrak S$ and parts
of $\mathfrak S$-decomposition of $G$.
This structure is close to the well known structure of
blocks and cutting points and the structure of decomposition
of biconnected graph, studied by W.T.Tutte.