2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/156380For 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 appearDiscrete Mathematicstext