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 2015Show all

3 papers · 1 filter

cs.DM2015

Graphs, Disjoint Matchings and Some Inequalities

Lianna Hambardzumyan, Vahan Mkrtchyan

For $k \geq 1$ and a graph $G$ let $ν_{k} (G)$ denote the size of a maximum $k$ -edge-colorable subgraph of $G$ . Mkrtchyan, Petrosyan and Vardanyan proved that $ν_2(G)\geq \frac45\cdot…

math.CO2015★ 3 cited

On Sylvester Colorings of Cubic Graphs

Anush Hakobyan, Vahan Mkrtchyan

If $G$ and $H$ are two cubic graphs, then an $H$ -coloring of $G$ is a proper edge-coloring $f$ with edges of $H$ , such that for each vertex $x$ of $G$ , there is a vertex $y$ of $H$ …

math.CO2015

Graph Theory

Petros A. Petrosyan, Vahan V. Mkrtchyan, Rafayel R. Kamalian

This book is based on Graph Theory courses taught by P.A. Petrosyan, V.V. Mkrtchyan and R.R. Kamalian at Yerevan State University.