A note on minimal matching covered graphs. - Vahan V. Mkrtchyan (Discret. Math., 2006)

On trees with a maximum proper partial 0-1 coloring containing a maximum matching. - Vahan V. Mkrtchyan (Discret. Math., 2006)

Two polynomial algorithms for special maximum matching constructing in trees - Rafael R. Kamalian; Vahan V. Mkrtchyan (CoRR, 2007)

On a constructive characterization of a class of trees related to pairs of disjoint matchings - Rafael R. Kamalian; Vahan V. Mkrtchyan (CoRR, 2007)

A course on Combinatorial Algorithms - Vahan V. Mkrtchyan (CoRR, 2007)

Problem 11305. - Vahan Mkrtchyan (Am. Math. Mon., 2007)

5-cycles and the Petersen graph - Matt DeVos; Vahan V. Mkrtchyan; Samvel S. Petrosyan (CoRR, 2008)

TRACTATUS on disjoint matchings in cubic graphs - Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (CoRR, 2008)

On complexity of special maximum matchings constructing. - Rafael R. Kamalian; Vahan V. Mkrtchyan (Discret. Math., 2008)

On edge-disjoint pairs of matchings. - Vahan V. Mkrtchyan; Vahe L. Musoyan; A. V. Tserunyan (Discret. Math., 2008)

An upper bound for a parameter related to special maximum matching constructing - Artur Khojabaghyan; Vahan V. Mkrtchyan (CoRR, 2009)

Complexity: an approach through independence - Sasun Hambartsumyan; Vahan V. Mkrtchyan; Vahe L. Musoyan; Hovhannes Sargsyan (CoRR, 2009)

On disjoint matchings in cubic graphs: maximum 3-edge-colorable subgraphs - Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (CoRR, 2009)

Disjoint Maximum-Sized Matchings: 11305 [2007, 640]. - Vahan Mkrtchyan; Codrut Grosu (Am. Math. Mon., 2009)

Maximum Delta-edge-colorable Subgraphs of Class II Graphs. - Vahan V. Mkrtchyan; Eckhard Steffen (CTW, 2010)

Bricks and conjectures of Berge, Fulkerson and Seymour - Vahan V. Mkrtchyan; Eckhard Steffen (CoRR, 2010)

On disjoint matchings in cubic graphs. - Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (Discret. Math., 2010)

A note on triangle-free graphs - Vahan V. Mkrtchyan; Petros A. Petrosyan (CoRR, 2011)

On spanning maximum k-edge-colorable subgraphs - Vahan V. Mkrtchyan; Gagik N. Vardanyan (CoRR, 2011)

On upper bounds for parameters related to the construction of special maximum matchings. - Artur Khojabaghyan; Vahan V. Mkrtchyan (Discret. Math., 2012)

Measures of edge-uncolorability. - Vahan V. Mkrtchyan; Eckhard Steffen (Discret. Math., 2012)

Maximum Δ-edge-colorable subgraphs of class II graphs. - Vahan V. Mkrtchyan; Eckhard Steffen (J. Graph Theory, 2012)

A remark on the Petersen coloring conjecture of Jaeger. - Vahan V. Mkrtchyan (Australas. J Comb., 2013)

Corrigendum to "On disjoint matchings in cubic graphs" [Discrete Math. 310 (2010) 1588-1613]. - Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (Discret. Math., 2013)

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. - Bugra Çaskurlu; Vahan Mkrtchyan; Ojas Parekh; K. Subramani 001 (IFIP TCS, 2014)

Clustering without replication: approximation and inapproximability. - Zola Donovan; Vahan Mkrtchyan; K. Subramani 001 (CoRR, 2014)

On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs. - Davit Aslanyan; Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (Discret. Appl. Math., 2014)

On Clustering Without Replication in Combinatorial Circuits. - Zola Donovan; Vahan Mkrtchyan; K. Subramani 001 (COCOA, 2015)

On Sylvester Colorings of Cubic Graphs. - Anush Hakobyan; Vahan Mkrtchyan (CoRR, 2015)

Cubic Graphs, Disjoint Matchings and Some Inequalities. - Lianna Hambardzumyan; Vahan Mkrtchyan (CoRR, 2015)

Graph Theory. - Petros A. Petrosyan; Vahan V. Mkrtchyan; Rafayel R. Kamalian (CoRR, 2015)

On the approximability of the Largest Sphere Rule Ensemble Classification problem. - Vahan Mkrtchyan; K. Subramani 001 (Inf. Process. Lett., 2015)

The Approximability of Partial Vertex Covers in Trees. - Vahan Mkrtchyan; Ojas Parekh; Danny Segev; K. Subramani 001 (SOFSEM, 2017)

Equitable colorings of corona multiproducts of graphs. - Hanna Furmanczyk; Marek Kubale; Vahan Mkrtchyan (Discuss. Math. Graph Theory, 2017)

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. - Bugra Çaskurlu; Vahan Mkrtchyan; Ojas Parekh; K. Subramani 001 (SIAM J. Discret. Math., 2017)

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. - Bugra Çaskurlu; Matthew D. Williamson; K. Subramani 001; Vahan Mkrtchyan; Piotr Wojciechowski 002 (CALDAM, 2018)

S12 and P12-colorings of cubic graphs. - Anush Hakobyan; Vahan Mkrtchyan (CoRR, 2018)

On approximating optimal weight "no"-certificates in weighted difference constraint systems. - Bugra Çaskurlu; Matthew D. Williamson; K. Subramani 001; Vahan Mkrtchyan (J. Comb. Optim., 2018)

A tight lower bound for the hardness of clutters. - Vahan Mkrtchyan; Hovhannes Sargsyan (J. Comb. Optim., 2018)

Disjoint Clustering in Combinatorial Circuits. - Zola Donovan; K. Subramani 001; Vahan Mkrtchyan (IWOCA, 2019)

S12 and P12-colorings of cubic graphs. - Anush Hakobyan; Vahan Mkrtchyan (Ars Math. Contemp., 2019)

On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem. - Alessandro Aloisio; Vahan Mkrtchyan (CoRR, 2019)

Parameterized algorithms for Partial vertex covers in bipartite graphs. - Vahan Mkrtchyan; Garik Petrosyan; K. Subramani 001 (CoRR, 2019)

On maximum k-edge-colorable subgraphs of bipartite graphs. - Liana Karapetyan; Vahan Mkrtchyan (Discret. Appl. Math., 2019)

Clustering without replication in combinatorial circuits. - Zola Donovan; Gregory Z. Gutin; Vahan Mkrtchyan; K. Subramani 001 (J. Comb. Optim., 2019)

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. - Vahan Mkrtchyan; Garik Petrosyan; K. Subramani 001; Piotr Wojciechowski 002 (IWOCA, 2020)

Normal 5-edge-colorings of a family of Loupekhine snarks. - Luca Ferrarini; Giuseppe Mazzuoccolo; Vahan Mkrtchyan (AKCE Int. J. Graphs Comb., 2020)

On two consequences of Berge-Fulkerson conjecture. - Vahan V. Mkrtchyan; Gagik N. Vardanyan (AKCE Int. J. Graphs Comb., 2020)

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs. - Janusz Dybizbanski; Hanna Furmanczyk; Vahan Mkrtchyan (CoRR, 2020)

Normal 6-edge-colorings of some bridgeless cubic graphs. - Giuseppe Mazzuoccolo; Vahan Mkrtchyan (Discret. Appl. Math., 2020)

Normal edge-colorings of cubic graphs. - Giuseppe Mazzuoccolo; Vahan Mkrtchyan (J. Graph Theory, 2020)

On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem. - Federico Corò; Gianlorenzo D'Angelo; Vahan Mkrtchyan (Theory Comput. Syst., 2020)

Analyzing Clustering and Partitioning Problems in Selected VLSI Models. - Zola Donovan; K. Subramani 001; Vahan V. Mkrtchyan (Theory Comput. Syst., 2020)

Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem. - Alessandro Aloisio; Vahan Mkrtchyan (AINA (3), 2021)

On sublinear approximations for the Petersen coloring conjecture. - Davide Mattiolo; Giuseppe Mazzuoccolo; Vahan Mkrtchyan (Bull. ICA, 2021)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs. - Hanna Furmanczyk; Vahan Mkrtchyan (Discret. Math. Theor. Comput. Sci., 2021)

On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs. - Vahan Mkrtchyan; Garik Petrosyan (J. Graph Algorithms Appl., 2022)

Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST. - Vahan Mkrtchyan (CoRR, 2023)

Decomposition of class II graphs into two class I graphs. - Yan Cao 001; Guangming Jing; Rong Luo; Vahan Mkrtchyan; Cun-Quan Zhang; Yue Zhao 008 (Discret. Math., 2023)

Two hardness results for the maximum 2-edge-colorable subgraph problem in bipartite graphs. - Vahan Mkrtchyan (CoRR, 2024)

Non-conflicting no-where zero Z2⨉ Z2 flows in cubic graphs. - Vahan Mkrtchyan (CoRR, 2024)

Gap one bounds for the equitable chromatic number of block graphs. - Janusz Dybizbanski; Hanna Furmanczyk; Vahan Mkrtchyan (Discret. Appl. Math., 2024)

The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability. - Vahan Mkrtchyan (J. Graph Algorithms Appl., 2024)

On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. - Vahan Mkrtchyan; Garik Petrosyan; K. Subramani 001; Piotr Wojciechowski 002 (Theory Comput. Syst., 2024)

Some snarks are worse than others. - Edita Mácajová; Giuseppe Mazzuoccolo; Vahan Mkrtchyan; Jean Paul Zerafa (Eur. J. Comb., 2024)

Approximation Algorithms for Partial Vertex Covers in Trees. - Vahan Mkrtchyan; Ojas Parekh; K. Subramani 001 (Int. J. Found. Comput. Sci., 2024)

Three results towards approximation of special maximum matchings in graphs. - Vahan Mkrtchyan (Discret. Appl. Math., 2025)

Expanding vertices to triangles in cubic graphs. - Giuseppe Mazzuoccolo; Vahan Mkrtchyan (CoRR, 2025)