Vahan V. Mkrtchyan

Available identifiers

zbMath Open mkrtchyan.vahan-vWikidataQ102421480 ScholiaQ102421480MaRDI QIDQ389445

List of research outcomes

Publication	Date of Publication	Type
Some snarks are worse than others	2024-01-23	Paper
Decomposition of class II graphs into two class I graphs	2023-10-04	Paper
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST	2023-01-03	Paper
On two consequences of Berge–Fulkerson conjecture	2021-10-05	Paper
On sublinear approximations for the Petersen coloring conjecture	2021-09-13	Paper
Normal 5-edge-colorings of a family of Loupekhine snarks	2021-09-01	Paper
Analyzing clustering and partitioning problems in selected VLSI models	2021-06-11	Paper
On the fixed-parameter tractability of the maximum connectivity improvement problem	2020-08-26	Paper
Sublinear bounds for nullity of flows and approximating Tutte's flow conjectures	2020-08-17	Paper
Normal edge‐colorings of cubic graphs	2020-05-21	Paper
Normal 6-edge-colorings of some bridgeless cubic graphs	2020-03-23	Paper
Disjoint clustering in combinatorial circuits	2020-02-25	Paper
Vizing-Goldberg type bounds for the equitable chromatic number of block graphs	2020-02-24	Paper
S_12 and P_12-colorings of cubic graphs	2020-02-21	Paper
Clustering without replication in combinatorial circuits	2019-06-25	Paper
On maximum \(k\)-edge-colorable subgraphs of bipartite graphs	2019-03-11	Paper
On Sylvester Colorings of Cubic Graphs	2019-02-13	Paper
On approximating optimal weight ``no-certificates in weighted difference constraint systems	2018-07-20	Paper
A fully polynomial time approximation scheme for refutations in weighted difference constraint systems	2018-06-05	Paper
A tight lower bound for the hardness of clutters	2018-02-21	Paper
Equitable colorings of corona multiproducts of graphs	2017-10-13	Paper
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs	2017-09-27	Paper
On strongly spanning k-edge-colorable subgraphs	2017-05-31	Paper
The Approximability of Partial Vertex Covers in Trees	2017-04-04	Paper
The hardness of the independence and matching clutter of a graph	2016-05-10	Paper
On Clustering Without Replication in Combinatorial Circuits	2016-02-05	Paper
Graphs, Disjoint Matchings and Some Inequalities	2015-12-08	Paper
Graph Theory	2015-10-04	Paper
On the approximability of the largest sphere rule ensemble classification problem	2015-07-15	Paper
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs	2014-09-15	Paper
On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs	2014-05-06	Paper
Corrigendum to: ``On disjoint matchings in cubic graphs	2014-01-20	Paper
A remark on Petersen coloring conjecture of Jaeger	2013-09-26	Paper
Maximum Δ-edge-colorable subgraphs of class II graphs	2012-08-31	Paper
On upper bounds for parameters related to the construction of special maximum matchings	2012-01-11	Paper
Measures of edge-uncolorability	2012-01-11	Paper
On disjoint matchings in cubic graphs	2010-05-05	Paper
On edge-disjoint pairs of matchings	2009-01-28	Paper
On complexity of special maximum matchings constructing	2008-11-12	Paper
A note on minimal matching covered graphs	2006-04-28	Paper
On trees with a maximum proper partial 0-1 coloring containing a maximum matching	2006-04-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Vahan V. Mkrtchyan