48 citations · 56 across the 2 of their papers we have counts for
1 paper · 1 filter
V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum m…