Balanced Graph Partitions
We prove that the set of vertices V, |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.
Key wordsbalanced graph coloring diameter of a graph star graph balanced partition spanning tree r-critical tree Cayley graph
Unable to display preview. Download preview PDF.