Removing vertices from a k-connected graph without losing its k-connectivity

The paper studies the problem of removing vertices from a k-connected graph without losing its k-connectivity. It is proved that certain inner vertices can be removed from k-blocks, provided that the interior of each block is sufficiently large with respect to its boundary, and the degree of every vertex of the graph is no less than or . Bibliography: 3 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 340, 2006, pp. 103–116.