Induced Minor Models. I. Structural Properties and Algorithmic Consequences

Nicolas Bousquet, Clément Dallard, Maël Dumas +4

A graph $H$ is said to be an induced minor of a graph $G$ if $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions. Equivalently, $H$ is an induced m…