1 citations · 1 across the 1 of their papers we have counts for
1 paper
Xiumei Wang, Xiaoxin Song, Jinjiang Yuan
A k-matching cover of a graph G is a union of k matchings of G which covers V(G). A matching cover of G is optimal if it consists of the fewest matchings of G. In thi…