For a k-connected graph, we define the notion of a block by means of local vertex connectivity and prove some properties of blocks that generalize the properties of classical biconnected blocks of a connected graph. We investigate the structure of the decomposition of a k-connected graph by several cuts. Bibliography: 9 titles.
展开▼