Vahan V. Mkrtchyan

Publication Activity (10 Years)

Years Active: 2006-2020
Publications (10 Years): 4

Top Topics

Negative Consequences

Top Venues

Theory Comput. Syst.

Discret. Appl. Math.

Publications

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