Weighted Connected Matchings

Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2

A matching $M$ is a $\mathcal{P}$-matching if the subgraph induced by the endpoints of the edges of $M$ satisfies property $\mathcal{P}$. As examples, for appropriate choices of $\…