Vahan V. Mkrtchyan
University of Paderborn
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Vahan V. Mkrtchyan.
Journal of Graph Theory | 2012
Vahan V. Mkrtchyan; Eckhard Steffen
A graph G is class II, if its chromatic index is at least δ + 1. Let H be a maximum δ-edge-colorable subgraph of G. The paper proves best possible lower bounds for |E(H)|/|E(G)|, and structural properties of maximum δ-edge-colorable subgraphs. It is shown that every set of vertex-disjoint cycles of a class II graph with δ≥3 can be extended to a maximum δ-edge-colorable subgraph. Simple graphs have a maximum δ-edge-colorable subgraph such that the complement is a matching. Furthermore, a maximum δ-edge-colorable subgraph of a simple graph is always class I.
arXiv: Discrete Mathematics | 2007
Rafael R. Kamalian; Vahan V. Mkrtchyan
Discrete Mathematics | 2012
Vahan V. Mkrtchyan; Eckhard Steffen
arXiv: Discrete Mathematics | 2010
Vahan V. Mkrtchyan; Eckhard Steffen
arXiv: Discrete Mathematics | 2018
Liana Karapetyan; Vahan V. Mkrtchyan
arXiv: Discrete Mathematics | 2018
Giuseppe Mazzuoccolo; Vahan V. Mkrtchyan
arXiv: Discrete Mathematics | 2018
Vahan V. Mkrtchyan; Gagik N. Vardanyan
Opuscula Mathematica | 2017
Vahan V. Mkrtchyan; Gagik N. Vardanyan
arXiv: Discrete Mathematics | 2015
Lianna Hambardzumyan; Vahan V. Mkrtchyan
arXiv: Discrete Mathematics | 2015
Lianna Hambardzumyan; Vahan V. Mkrtchyan
