A special case for subset interconnectio
โ
Du Ding-Zhu; Gao Biao; Wu Weili
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 528 KB
Given a set X and subsets Xl.. .X,,,, me consider the problem of finding a graph G with vertex set X and the minimum number of edges such that for i = 1.. ,m, the subgraph G, induced by X, is connected. WC show that in the special cast that every point in X appears in at most three X,'s, the problem