| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Artur Khojabaghyan, Vahan V. Mkrtchyan |
On upper bounds for parameters related to the construction of special maximum matchings.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Eckhard Steffen |
Measures of edge-uncolorability. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan |
A remark on Petersen coloring conjecture of Jaeger |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Gagik N. Vardanyan |
On spanning maximum k-edge-colorable subgraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Petros A. Petrosyan |
A note on triangle-free graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan |
On disjoint matchings in cubic graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Eckhard Steffen |
Measures of edge-uncolorability |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Eckhard Steffen |
Bricks and conjectures of Berge, Fulkerson and Seymour |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Eckhard Steffen |
Maximum $\Delta$-edge-colorable subgraphs of class II graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Eckhard Steffen |
Maximum Delta-edge-colorable Subgraphs of Class II Graphs. |
CTW |
2010 |
DBLP BibTeX RDF |
|
| 1 | Artur Khojabaghyan, Vahan V. Mkrtchyan |
An upper bound for a parameter related to special maximum matching constructing |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sasun Hambartsumyan, Vahan V. Mkrtchyan, Vahe L. Musoyan, Hovhannes Sargsyan |
Complexity: an approach through independence |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan |
On disjoint matchings in cubic graphs: maximum 3-edge-colorable subgraphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Vahe L. Musoyan, A. V. Tserunyan |
On edge-disjoint pairs of matchings. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael R. Kamalian, Vahan V. Mkrtchyan |
On complexity of special maximum matchings constructing. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan |
5-cycles and the Petersen graph |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan |
TRACTATUS on disjoint matchings in cubic graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan |
A note on minimal matching covered graphs |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan |
On trees with a maximum proper partial 0-1 coloring containing a maximum matching |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan, Vahe L. Musoyan, A. V. Tserunyan |
On Edge-Disjoint Pairs Of Matchings |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rafael R. Kamalian, Vahan V. Mkrtchyan |
On complexity of special maximum matchings constructing |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rafael R. Kamalian, Vahan V. Mkrtchyan |
Two polynomial algorithms for special maximum matching constructing in trees |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rafael R. Kamalian, Vahan V. Mkrtchyan |
On a constructive characterization of a class of trees related to pairs of disjoint matchings |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan |
A course on Combinatorial Algorithms |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan |
On trees with a maximum proper partial 0-1 coloring containing a maximum matching. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan |
A note on minimal matching covered graphs. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")