The following pages link to Vahan V. Mkrtchyan (Q389445):
Displaying 50 items.
- Corrigendum to: ``On disjoint matchings in cubic graphs'' (Q389448) (← links)
- On upper bounds for parameters related to the construction of special maximum matchings (Q658043) (← links)
- Measures of edge-uncolorability (Q658079) (← links)
- (Q721916) (redirect page) (← links)
- On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917) (← links)
- (Q952635) (redirect page) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- On edge-disjoint pairs of matchings (Q998470) (← links)
- A tight lower bound for the hardness of clutters (Q1698055) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- Coloring Delaunay-edges and their generalizations (Q1984605) (← links)
- Gallai-Ramsey numbers for multiple triangles (Q2028090) (← links)
- Analyzing clustering and partitioning problems in selected VLSI models (Q2032285) (← links)
- Decomposition of complete graphs into arbitrary trees (Q2042202) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- Graphs in which all maximal bipartite subgraphs have the same order (Q2216453) (← links)
- On proper (strong) rainbow connection of graphs (Q2227108) (← links)
- Disjoint clustering in combinatorial circuits (Q2301744) (← links)
- Normal 6-edge-colorings of some bridgeless cubic graphs (Q2306603) (← links)
- On the approximability of the largest sphere rule ensemble classification problem (Q2353652) (← links)
- A note on minimal matching covered graphs (Q2368933) (← links)
- On trees with a maximum proper partial 0-1 coloring containing a maximum matching (Q2368934) (← links)
- Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
- Clustering without replication in combinatorial circuits (Q2424822) (← links)
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123) (← links)
- A fully polynomial time approximation scheme for refutations in weighted difference constraint systems (Q2636553) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)
- The hardness of the independence and matching clutter of a graph (Q2805262) (← links)
- A remark on Petersen coloring conjecture of Jaeger (Q2848732) (← links)
- Maximum Δ-edge-colorable subgraphs of class II graphs (Q2911495) (← links)
- The Approximability of Partial Vertex Covers in Trees (Q2971146) (← links)
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs (Q3190147) (← links)
- On Clustering Without Replication in Combinatorial Circuits (Q3467855) (← links)
- On Sylvester Colorings of Cubic Graphs (Q4622633) (← links)
- On sublinear approximations for the Petersen coloring conjecture (Q4959474) (← links)
- Normal 5-edge-colorings of a family of Loupekhine snarks (Q5012370) (← links)
- Normal edge‐colorings of cubic graphs (Q5110677) (← links)
- On two consequences of Berge–Fulkerson conjecture (Q5154629) (← links)
- S_12 and P_12-colorings of cubic graphs (Q5217082) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- On strongly spanning k-edge-colorable subgraphs (Q5737974) (← links)
- The lexicographic method for the threshold cover problem (Q5896104) (← links)
- Decomposition of class II graphs into two class I graphs (Q6080564) (← links)
- Some snarks are worse than others (Q6181999) (← links)
- Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs (Q6507510) (← links)
- Block graphs - some general results and their equitable colorings (Q6520840) (← links)
- Approximation algorithms for partial vertex covers in trees (Q6554733) (← links)
- Gap one bounds for the equitable chromatic number of block graphs (Q6558671) (← links)
- Graphs, disjoint matchings and some inequalities (Q6615584) (← links)
