Another Proof of a Theorem Concerning Detachments of Graphs

Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a new proof of a theorem which characterizes the least possible number of components of a graph obtainable from G by splitting each vertex ξ into b(ξ) vertices.