18 citations · 54 across the 7 of their papers we have counts for
7 papers
5-cycles and the Petersen graph
Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan
We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph.
A course on Combinatorial Algorithms
V. V. Mkrtchyan
The paper presents a course on Combinatorial Algorithms that is based on the drafts of the author that he used while teaching the course in the Department of Informatics and Applie…
On Edge-Disjoint Pairs Of Matchings
V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum m…
Two polynomial algorithms for special maximum matching constructing in trees
R. R. Kamalian, V. V. Mkrtchyan
For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from o…
On complexity of special maximum matchings constructing
R. R. Kamalian, V. V. Mkrtchyan
For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality…
On trees with a maximum proper partial 0-1 coloring containing a maximum matching
V. V. Mkrtchyan
I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum match…