Blocks in $k$-connected graphs

For a $k$-connected graph with the help of local vertex connectivity we determine a notion of block and prove some properties of blocks, which generalize the properties of classic biconnected blocks. We investigate the structure of division of a $k$-connected graph by several cutting sets.