论文信息 - On Edge-Disjoint Pairs Of Matchings

On Edge-Disjoint Pairs Of Matchings

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 matching of G. We show that 5/4 is a tight upper bound for |M|/|H|.

Vahan V. Mkrtchyan | Vahe L. Musoyan | A. V. Tserunyan

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Frank Harary,et al. On the Core of a Graph , 1967 .

[3] Vahan V. Mkrtchyan. On trees with a maximum proper partial 0-1 coloring containing a maximum matching , 2006, Discret. Math..

[4] Vahan V. Mkrtchyan. A note on minimal matching covered graphs , 2006, Discret. Math..

[5] Anush Tserunyan,et al. Characterization of a class of graphs related to pairs of disjoint matchings , 2007, Discret. Math..

[6] D. West. Introduction to Graph Theory , 1995 .