Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion

摘要

A diamond is a graph obtained by removing an edge from a complete graph on four vertices. A graph is diamond-free if it does not contain an induced diamond. The Diamond-free Edge Deletion problem asks to find whether there exist at most k edges in the inp