A Polynomial Kernel for Paw-Free Editing

Eduard Eiben, William Lochet, Saket Saurabh

For a fixed graph $H$, the $H$-free-editing problem asks whether we can modify a given graph $G$ by adding or deleting at most $k$ edges such that the resulting graph does not cont…