20 citations · 33 across the 2 of their papers we have counts for
4 papers · 1 filter
On two consequences of Berge-Fulkerson conjecture
Vahan V. Mkrtchyan, Gagik N. Vardanyan
The classical Berge-Fulkerson conjecture states that any bridgeless cubic graph admits a list of six perfect matchings such that each edge of belongs to two of the perfect…
On strongly spanning -edge-colorable subgraphs
Vahan V. Mkrtchyan, Gagik N. Vardanyan
A subgraph of a multigraph is called strongly spanning, if any vertex of is not isolated in , while it is called maximum -edge-colorable, if is proper -edg…
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…
On disjoint matchings in cubic graphs
Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan
For and a cubic graph let denote the maximum number of edges that can be covered by matchings. We show that and $ν_{3}(G)\ge…