On the structure of $k$-connected graphs

For $k$-connected graph we determine a notion of block and build a block tree. These constructions generalize well known and important in graph theory notion of block for the case of $k$-connected graph. With the help of these notions we describe such set $W$ of vertices of $k$-connected graph, that one can delete from graph any subset of $W$ without less of vertex connectivity.