On complexity of special maximum matchings constructing
Discrete Mathematics
2008-03-08 v1
Abstract
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 of its maximum matching.
Cite
@article{arxiv.0707.2126,
title = {On complexity of special maximum matchings constructing},
author = {R. R. Kamalian and V. V. Mkrtchyan},
journal= {arXiv preprint arXiv:0707.2126},
year = {2008}
}
Comments
12 pages, 8 figures. Discrete Mathematics, to appear