| 2009 |
| 15 | EE | Artur Khojabaghyan,
Vahan V. Mkrtchyan:
An upper bound for a parameter related to special maximum matching constructing
CoRR abs/0901.0121: (2009) |
| 14 | EE | Sasun Hambartsumyan,
Vahan V. Mkrtchyan,
Vahe L. Musoyan,
Hovhannes Sargsyan:
Complexity: an approach through independence
CoRR abs/0903.4907: (2009) |
| 2008 |
| 13 | EE | Matt DeVos,
Vahan V. Mkrtchyan,
Samvel S. Petrosyan:
5-cycles and the Petersen graph
CoRR abs/0801.3714: (2008) |
| 12 | EE | Vahan V. Mkrtchyan,
Samvel S. Petrosyan,
Gagik N. Vardanyan:
TRACTATUS on disjoint matchings in cubic graphs
CoRR abs/0803.0134: (2008) |
| 11 | EE | Rafael R. Kamalian,
Vahan V. Mkrtchyan:
On complexity of special maximum matchings constructing.
Discrete Mathematics 308(10): 1792-1800 (2008) |
| 10 | EE | Vahan V. Mkrtchyan,
Vahe L. Musoyan,
A. V. Tserunyan:
On edge-disjoint pairs of matchings.
Discrete Mathematics 308(23): 5823-5828 (2008) |
| 2007 |
| 9 | EE | Vahan V. Mkrtchyan:
A note on minimal matching covered graphs
CoRR abs/0707.1925: (2007) |
| 8 | EE | Vahan V. Mkrtchyan:
On trees with a maximum proper partial 0-1 coloring containing a maximum matching
CoRR abs/0707.1926: (2007) |
| 7 | EE | Rafael R. Kamalian,
Vahan V. Mkrtchyan:
On complexity of special maximum matchings constructing
CoRR abs/0707.2126: (2007) |
| 6 | EE | Rafael R. Kamalian,
Vahan V. Mkrtchyan:
Two polynomial algorithms for special maximum matching constructing in trees
CoRR abs/0707.2295: (2007) |
| 5 | EE | Vahan V. Mkrtchyan,
Vahe L. Musoyan,
A. V. Tserunyan:
On Edge-Disjoint Pairs Of Matchings
CoRR abs/0708.1903: (2007) |
| 4 | EE | Rafael R. Kamalian,
Vahan V. Mkrtchyan:
On a constructive characterization of a class of trees related to pairs of disjoint matchings
CoRR abs/0708.2363: (2007) |
| 3 | EE | Vahan V. Mkrtchyan:
A course on Combinatorial Algorithms
CoRR abs/0708.3962: (2007) |
| 2006 |
| 2 | EE | Vahan V. Mkrtchyan:
A note on minimal matching covered graphs.
Discrete Mathematics 306(4): 452-455 (2006) |
| 1 | EE | Vahan V. Mkrtchyan:
On trees with a maximum proper partial 0-1 coloring containing a maximum matching.
Discrete Mathematics 306(4): 456-459 (2006) |