1 paper
Yixin Cao, Ashutosh Rai, R. B. Sandeep +1
An H-free editing problem asks whether we can edit at most k edges to make a graph contain no induced copy of the fixed graph H. We obtain a polynomial kernel for this proble…