Vahan V. Mkrtchyan

35 papers C 1Journal 34
YearRankTypeTitle / Venue / Authors
2020 J jnl
Analyzing Clustering and Partitioning Problems in Selected VLSI Models.
Theory Comput. Syst.
Zola Donovan, K. Subramani, Vahan V. Mkrtchyan
2020 J jnl
On two consequences of Berge-Fulkerson conjecture.
AKCE Int. J. Graphs Comb.
Vahan V. Mkrtchyan, Gagik N. Vardanyan
2018 J jnl
On two consequences of Berge-Fulkerson conjecture.
CoRR
Vahan V. Mkrtchyan, Gagik N. Vardanyan
2015 J jnl
Graph Theory.
CoRR
Petros A. Petrosyan, Vahan V. Mkrtchyan, Rafayel R. Kamalian
2014 J jnl
On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs.
Discret. Appl. Math.
Davit Aslanyan, Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan
2013 J jnl
A remark on the Petersen coloring conjecture of Jaeger.
Australas. J Comb.
Vahan V. Mkrtchyan
2013 J jnl
Corrigendum to "On disjoint matchings in cubic graphs" [Discrete Math. 310 (2010) 1588-1613].
Discret. Math.
Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan
2012 J jnl
A remark on Petersen coloring conjecture of Jaeger
CoRR
Vahan V. Mkrtchyan
2012 J jnl
Equitable Colorings of Corona Multiproducts of Graphs
CoRR
Hanna Furmanczyk, Marek Kubale, Vahan V. Mkrtchyan
2012 J jnl
Maximum Δ-edge-colorable subgraphs of class II graphs.
J. Graph Theory
Vahan V. Mkrtchyan, Eckhard Steffen
2012 J jnl
Measures of edge-uncolorability.
Discret. Math.
Vahan V. Mkrtchyan, Eckhard Steffen
2012 J jnl
On upper bounds for parameters related to the construction of special maximum matchings.
Discret. Math.
Artur Khojabaghyan, Vahan V. Mkrtchyan
2011 J jnl
A note on triangle-free graphs
CoRR
Vahan V. Mkrtchyan, Petros A. Petrosyan
2011 J jnl
On spanning maximum k-edge-colorable subgraphs
CoRR
Vahan V. Mkrtchyan, Gagik N. Vardanyan
2010 J jnl
Bricks and conjectures of Berge, Fulkerson and Seymour
CoRR
Vahan V. Mkrtchyan, Eckhard Steffen
2010 J jnl
Maximum $\Delta$-edge-colorable subgraphs of class II graphs
CoRR
Vahan V. Mkrtchyan, Eckhard Steffen
2010 C conf
Maximum Delta-edge-colorable Subgraphs of Class II Graphs.
CTW
Vahan V. Mkrtchyan, Eckhard Steffen
2010 J jnl
Measures of edge-uncolorability
CoRR
Vahan V. Mkrtchyan, Eckhard Steffen
2010 J jnl
On disjoint matchings in cubic graphs.
Discret. Math.
Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan
2009 J jnl
An upper bound for a parameter related to special maximum matching constructing
CoRR
Artur Khojabaghyan, Vahan V. Mkrtchyan
2009 J jnl
Complexity: an approach through independence
CoRR
Sasun Hambartsumyan, Vahan V. Mkrtchyan, Vahe L. Musoyan, Hovhannes Sargsyan
2009 J jnl
On disjoint matchings in cubic graphs: maximum 3-edge-colorable subgraphs
CoRR
Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan
2008 J jnl
5-cycles and the Petersen graph
CoRR
Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan
2008 J jnl
On complexity of special maximum matchings constructing.
Discret. Math.
Rafael R. Kamalian, Vahan V. Mkrtchyan
2008 J jnl
On edge-disjoint pairs of matchings.
Discret. Math.
Vahan V. Mkrtchyan, Vahe L. Musoyan, A. V. Tserunyan
2008 J jnl
TRACTATUS on disjoint matchings in cubic graphs
CoRR
Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan
2007 J jnl
A course on Combinatorial Algorithms
CoRR
Vahan V. Mkrtchyan
2007 J jnl
A note on minimal matching covered graphs
CoRR
Vahan V. Mkrtchyan
2007 J jnl
On Edge-Disjoint Pairs Of Matchings
CoRR
Vahan V. Mkrtchyan, Vahe L. Musoyan, A. V. Tserunyan
2007 J jnl
On a constructive characterization of a class of trees related to pairs of disjoint matchings
CoRR
Rafael R. Kamalian, Vahan V. Mkrtchyan
2007 J jnl
On complexity of special maximum matchings constructing
CoRR
Rafael R. Kamalian, Vahan V. Mkrtchyan
2007 J jnl
On trees with a maximum proper partial 0-1 coloring containing a maximum matching
CoRR
Vahan V. Mkrtchyan
2007 J jnl
Two polynomial algorithms for special maximum matching constructing in trees
CoRR
Rafael R. Kamalian, Vahan V. Mkrtchyan
2006 J jnl
A note on minimal matching covered graphs.
Discret. Math.
Vahan V. Mkrtchyan
2006 J jnl
On trees with a maximum proper partial 0-1 coloring containing a maximum matching.
Discret. Math.
Vahan V. Mkrtchyan