|
Zapiski Nauchnykh Seminarov POMI, 2014, Volume 427, Pages 66–73
(Mi znsl6043)
|
|
|
|
Deleting vertices from a biconnected graph with preserving biconnectinity
D. V. Karpovab a St. Petersburg Department of V. A. Steklov Institute of Mathematics of the Russian Academy of Sciences, St. Petersburg, Russia
b St. Petersburg State University, Department of Mathematics and Mechanics, St. Petersburg, Russia
Abstract:
Let $G$ be a biconnected graph and $W$ be a set which consists of inner vertices of parts-blocks of the graph $G$ and contains at least one vertex of each such part. It is proved that the graph $G-W$ is biconnected.
Key words and phrases:
connectivity, biconnected graph, blocks.
Received: 27.10.2014
Citation:
D. V. Karpov, “Deleting vertices from a biconnected graph with preserving biconnectinity”, Combinatorics and graph theory. Part VII, Zap. Nauchn. Sem. POMI, 427, POMI, St. Petersburg, 2014, 66–73; J. Math. Sci. (N. Y.), 212:6 (2016), 683–687
Linking options:
https://www.mathnet.ru/eng/znsl6043 https://www.mathnet.ru/eng/znsl/v427/p66
|
Statistics & downloads: |
Abstract page: | 170 | Full-text PDF : | 58 | References: | 27 |
|