| 2008 |
|---|
| 7 | EE | Rafael R. Kamalian,
Vahan V. Mkrtchyan:
On complexity of special maximum matchings constructing.
Discrete Mathematics 308(10): 1792-1800 (2008) |
| 2007 |
|---|
| 6 | EE | Rafael R. Kamalian,
Vahan V. Mkrtchyan:
On complexity of special maximum matchings constructing
CoRR abs/0707.2126: (2007) |
| 5 | EE | Rafael R. Kamalian,
Vahan V. Mkrtchyan:
Two polynomial algorithms for special maximum matching constructing in trees
CoRR abs/0707.2295: (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 | Rafael R. Kamalian,
Petros A. Petrosyan:
On Lower Bound for W(K2n)
CoRR abs/0712.2567: (2007) |
| 2 | EE | Rafael R. Kamalian,
Petros A. Petrosyan:
Interval Colourings of Some Regular Graphs
CoRR abs/0712.3150: (2007) |
| 1 | EE | Rafael R. Kamalian,
Petros A. Petrosyan:
On Interval Colorings of Complete k-partite Graphs K_{n}^{k}
CoRR abs/0712.3155: (2007) |
