Email this article Decomposition of a 2-Connected Graph into Three Connected Subgraphs
- Authors: Karpov D.V.1
-
Affiliations:
- St. Petersburg Department of Steklov Institute of Mathematics and St. Petersburg State University
- Issue: Vol 236, No 5 (2019)
- Pages: 490-502
- Section: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/242253
- DOI: https://doi.org/10.1007/s10958-018-4127-z
- ID: 242253
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
D. V. Karpov
St. Petersburg Department of Steklov Institute of Mathematics and St. Petersburg State University
Author for correspondence.
Email: dvk0@yandex.ru
Russian Federation, St. Petersburg
