2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/134124A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.4 pagesDiscrete Mathematicstext