12 citations · 12 across the 1 of their papers we have counts for
1 paper
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…