20 citations · 146 across the 41 of their papers we have counts for
Showing 2009 · cs.DMShow all
2 papers · 2 filters
cs.DM2009★ 13 cited
On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs
Davit Aslanyan, Vahan V. Mkrtchyan, Samvel S. Petrosyan +1
We show that any factor of a cubic graph can be extended to a maximum edge-colorable subgraph. We also show that the sum of sizes of maximum and edge-colorable sub…
cs.DM2009★ 1 cited
On upper bounds for parameters related to construction of special maximum matchings
Artur Khojabaghyan, Vahan V. Mkrtchyan
For a graph let and denote the size of the largest and smallest maximum matching of a graph obtained from by removing a maximum matching of . We show that…