Found 1 document(s)
Page 1 of 1
-
A graph G = (V;E) is arbitrarily partitionable if for any sequence of posi- tive integers adding up to jV j, there is a sequence of vertex-disjoint subsets of V whose orders are given by , and which induce connected subg...