V. Mkrtchyan

activity

20072026

most citedOn disjoint matchings in cubic graphs

20 citations · 146 across the 41 of their papers we have counts for

collaborators

Showing 2024 · math.COShow all

4 papers · 2 filters

math.CO2024

Non-conflicting no-where zero $Z_{2} \times Z_{2}$ flows in cubic graphs

Vahan Mkrtchyan

Let $Z_{2} \times Z_{2} = {0, α, β, α + β}$ . If $G$ is a bridgeless cubic graph, $F$ is a perfect matching of $G$ and $F$ is the complementary 2-factor of $F$ , then a no-where…

math.CO2024★ 1 cited

Three results towards the approximation of special maximum matchings in graphs

Vahan Mkrtchyan

For a graph $G$ define the parameters $ℓ (G)$ and $L (G)$ as the minimum and maximum value of $ν (G \ F)$ , where $F$ is a maximum matching of $G$ and $ν (G)$ is the matching…

math.CO2024★ 1 cited

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs

Vahan Mkrtchyan

In this paper, we consider the maximum $k$ -edge-colorable subgraph problem. In this problem we are given a graph $G$ and a positive integer $k$ , the goal is to take $k$ matchings o…

math.CO2024

Block graphs - some general results and their equitable colorings

Hanna Furmańczyk, Vahan Mkrtchyan

In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation be…

Non-conflicting no-where zero Z2​×Z2​ flows in cubic graphs

Three results towards the approximation of special maximum matchings in graphs

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs

Block graphs - some general results and their equitable colorings

Non-conflicting no-where zero $Z_{2} \times Z_{2}$ flows in cubic graphs