Polynomial kernelization for removing induced claws and diamonds

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk +2

A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-…