12 citations · 19 across the 4 of their papers we have counts for
4 papers
Interval Colourings of Some Regular Graphs
Rafael R. Kamalian, Petros A. Petrosyan
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
On Lower Bound for W(K_{2n})
Rafael R. Kamalian, Petros A. Petrosyan
The lower bound W(K_{2n})>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K_{2n}.
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…