Citation: Js. Provan et Mk. Chari, COUNTING PROBLEMS ASSOCIATED WITH STEINER TREES IN GRAPHS, SIAM journal on discrete mathematics, 10(3), 1997, pp. 436-446
Citation: Mk. Chari, 2 DECOMPOSITIONS IN TOPOLOGICAL COMBINATORICS WITH APPLICATIONS TO MATROID COMPLEXES, Transactions of the American Mathematical Society, 349(10), 1997, pp. 3925-3943
Citation: Mk. Chari et Js. Provan, CALCULATING K-CONNECTEDNESS RELIABILITY USING STEINER BOUNDS, Mathematics of operations research, 21(4), 1996, pp. 905-921