Removing vertices from $k$-connected graphs without losing $k$-connectivity
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part I, Tome 340 (2006), pp. 103-116
Citer cet article
Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
The problem of removing vertices from a $k$-connected graph without losing $k$-connectivity is studied. We prove that one can remove some inner vertices from $k$-blocks, provided the interior of each block is large enough with respect to its boundary and the degree of any vertex of the graph is greater than $\frac{3k-1}{2}$ or $\frac{3k}{2}$.
[1] G. Chartrand, A. Kaugars, D. R. Lick, “Critically $n$-connected graphs”, Proc. Amer. Math. Soc., 32:1 (1972), 63–68 | DOI | MR
[2] D. V. Karpov, A. V. Pastor, “O strukture $k$-svyaznogo grafa”, Zap. nauchn. semin. POMI, 266, 2000, 76–106 | MR
[3] D. V. Karpov, “Bloki v $k$-svyaznykh grafakh”, Zap. nauchn. semin. POMI, 293, 2002, 59–93 | MR | Zbl