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.
[1] D. R. Fulkerson,et al. Transversals and Matroid Partition , 1965 .
[2] C. Nash-Williams,et al. Connected detachments of graphs and generalized Euler trails , 1985 .