论文部分内容阅读
Given a complete graph with vertex set X and subsets X1,X2,...,Xn, the problem of finding a subgraph G with minimum number of edges such that for every i= 1, 2, ...,n, G contains a spanning tree on Xi, arises in the design of vaccum systems. In general, t