Tree decompositions meet induced matchings: beyond Max Weight Independent Set

Paloma T. Lima, Martin Milanič, Peter Muršič +3

For a tree decomposition $\mathcal{T}$ of a graph $G$, by $\mu (\mathcal{T})$ we denote the size of a largest induced matching in $G$ all of whose edges intersect one bag of $\mathcal…