TY - JOUR

T1 - Decomposition of a 2-Connected Graph into Three Connected Subgraphs

AU - Karpov, D. V.

N1 - Karpov, D.V. J Math Sci (2019) 236: 490. https://doi.org/10.1007/s10958-018-4127-z

PY - 2019/2

Y1 - 2019/2

N2 - Let n 1+n 2+n 3 = 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 V 1, V 2, V 3 such that |V i| = n i and the induced subgraph G(V i) is connected for every i.

AB - Let n 1+n 2+n 3 = 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 V 1, V 2, V 3 such that |V i| = n i and the induced subgraph G(V i) is connected for every i.

UR - http://www.scopus.com/inward/record.url?scp=85058660454&partnerID=8YFLogxK

U2 - 10.1007/s10958-018-4127-z

DO - 10.1007/s10958-018-4127-z

M3 - Article

VL - 236

SP - 490

EP - 502

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 5

ER -