电邮这篇文章 Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness
- 作者: Karpov D.V.1
-
隶属关系:
- St.Petersburg Department of the Steklov Mathematical Institute, St.Petersburg State University
- 期: 卷 212, 编号 6 (2016)
- 页面: 683-687
- 栏目: Article
- URL: https://ogarev-online.ru/1072-3374/article/view/237124
- DOI: https://doi.org/10.1007/s10958-016-2698-0
- ID: 237124
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
D. Karpov
St.Petersburg Department of the Steklov Mathematical Institute, St.Petersburg State University
编辑信件的主要联系方式.
Email: dvk0@yandex.ru
俄罗斯联邦, St. Petersburg
补充文件
