8 citations · 24 across the 14 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2007★ 6 cited
Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings
A. V. Tserunyan
For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum…
cs.DM2007★ 8 cited
On Edge-Disjoint Pairs Of Matchings
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…