Steklov Institute of Mathematics at St.Petersburg

PREPRINT 15/2005

Разделяющие множества в k-связном графе

This preprint was accepted October 3, 2005

ABSTRACT:
We prove a  splitting theorem  and study the structure of k-vertex cuts of a $k$-vertex-connected graph with the help of this new tool.
A case of a biconnected graph is described in details as an illustration for our 
method.