On complexity of special maximum matchings constructing
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
12 pages, 8 figures. Discrete Mathematics, to appear
12 pages, 8 figures. Discrete Mathematics, to appear