Article ID Journal Published Year Pages File Type
4649686 Discrete Mathematics 2008 9 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On complexity of special maximum matchings constructing
Authors
, ,