Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs

Öznur Yaşar Diner, Daniël Paulusma, Christophe Picouleau +1

We study the following problem: for given integers $d$, $k$ and graph $G$, can we reduce some fixed graph parameter $\pi$ of $G$ by at least $d$ via at most $k$ graph operations from…