2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/134466For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.55 pages, 38 figures, Submitted to Discrete Applied MathematicsDiscrete Mathematicstext