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
Cet article a éte moissonné depuis 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}$.
@article{ZNSL_2006_340_a6,
author = {A. S. Chukhnov},
title = {Removing vertices from $k$-connected graphs without losing $k$-connectivity},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {103--116},
year = {2006},
volume = {340},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2006_340_a6/}
}
A. S. Chukhnov. 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. http://geodesic.mathdoc.fr/item/ZNSL_2006_340_a6/
[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