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