Decomposition of a 2-Connected Graph into Three Connected Subgraphs
- 作者: Karpov D.1
-
隶属关系:
- St. Petersburg Department of Steklov Institute of Mathematics and St. Petersburg State University
- 期: 卷 236, 编号 5 (2019)
- 页面: 490-502
- 栏目: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/242253
- DOI: https://doi.org/10.1007/s10958-018-4127-z
- ID: 242253
如何引用文章
详细
Let n1+n2+n3 = n, and let G be a 2-connected graph on n vertices such that any 2-vertex cutset of G splits it into at most three parts. We prove that there exists a decomposition of the vertex set of G into three disjoint subsets V1, V2, V3 such that |Vi| = ni and the induced subgraph G(Vi) is connected for every i.
作者简介
D. Karpov
St. Petersburg Department of Steklov Institute of Mathematics and St. Petersburg State University
编辑信件的主要联系方式.
Email: dvk0@yandex.ru
俄罗斯联邦, St. Petersburg