Email this article Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness
- Authors: Karpov D.V.1
-
Affiliations:
- St.Petersburg Department of the Steklov Mathematical Institute, St.Petersburg State University
- Issue: Vol 212, No 6 (2016)
- Pages: 683-687
- Section: Article
- URL: https://journal-vniispk.ru/1072-3374/article/view/237124
- DOI: https://doi.org/10.1007/s10958-016-2698-0
- ID: 237124
Cite item
Open Access
Access granted
Subscription Access
Abstract
Let G be a 2-connected graph, and let W be a set of internal vertices of block parts of G that contains at least one vertex in each of these parts. It is proved that the graph G−W is 2-connected.
About the authors
D. V. Karpov
St.Petersburg Department of the Steklov Mathematical Institute, St.Petersburg State University
Author for correspondence.
Email: dvk0@yandex.ru
Russian Federation, St. Petersburg
Supplementary files
