Polynomial Kernels for Paw-free Edge Modification Problems

Yixin Cao, Yuping Ke, Hanchun Yuan

Let $H$ be a fixed graph. Given a graph $G$ and an integer $k$, the $H$-free edge modification problem asks whether it is possible to modify at most $k$ edges in $G$ to make it $H$…