20 citations · 146 across the 41 of their papers we have counts for
46 papers
Some new results on Sylvester colorings of cubic graphs
Luca Ferrarini, Vahan Mkrtchyan
If and are two cubic multi-graphs, then an -coloring of is a mapping , such that for every there is a vertex , such t…
Expanding vertices to triangles in cubic graphs
Giuseppe Mazzuoccolo, Vahan Mkrtchyan
Contraction of triangles is a standard operation in the study of cubic graphs, as it reduces the order of the graph while typically preserving many of its properties. In this paper…
Non-conflicting no-where zero flows in cubic graphs
Vahan Mkrtchyan
Let . If is a bridgeless cubic graph, is a perfect matching of and is the complementary 2-factor of , then a no-where…
Three results towards the approximation of special maximum matchings in graphs
Vahan Mkrtchyan
For a graph define the parameters and as the minimum and maximum value of , where is a maximum matching of and is the matching…
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
Vahan Mkrtchyan
In this paper, we consider the maximum -edge-colorable subgraph problem. In this problem we are given a graph and a positive integer , the goal is to take matchings o…
Block graphs - some general results and their equitable colorings
Hanna Furmańczyk, Vahan Mkrtchyan
In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation be…