Finding sparse induced subgraphs on graphs of bounded induced matching treewidth

Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen

The induced matching width of a tree decomposition of a graph $G$ is the cardinality of a largest induced matching $M$ of $G$, such that there exists a bag that intersects every ed…