$\mathcal{P}$-matchings Parameterized by Treewidth

Juhi Chaudhary, Meirav Zehavi

A \emph{matching} is a subset of edges in a graph $G$ that do not share an endpoint. A matching $M$ is a \emph{$\mathcal{P}$-matching} if the subgraph of $G$ induced by the endpoin…