|
Balanced Graph Partitions
K. D. Protasova
Abstract:
We prove that the set of vertices $\mathscr V$, $|\mathscr V|=rk$, of a connected graph $G$ can be split into $r$ subsets of the same cardinality in such a way that the distance between any vertex of $G$ and any subset of the partition is at most $r$.
Received: 29.08.2002 Revised: 24.05.2005
Citation:
K. D. Protasova, “Balanced Graph Partitions”, Mat. Zametki, 79:1 (2006), 127–133; Math. Notes, 79:1 (2006), 116–121
Linking options:
https://www.mathnet.ru/eng/mzm2681https://doi.org/10.4213/mzm2681 https://www.mathnet.ru/eng/mzm/v79/i1/p127
|
|