Decomposition of a 2-Connected Graph into Three Connected Subgraphs

被引：0
|
作者：
Karpov D.V. [1 ]
机构：
[1] St. Petersburg Department of Steklov Institute of Mathematics and St. Petersburg State University, St. Petersburg
来源：
Journal of Mathematical Sciences | 2019年 / 236卷 / 5期
关键词：
D O I：
10.1007/s10958-018-4127-z
中图分类号：
学科分类号：
摘要：
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. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.
引用
收藏
页码：490 / 502
页数：12
相关论文
共 50 条
12345