2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/134125I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum matching.4 pagesDiscrete Mathematicstext