Structural Parameterizations of the Biclique-Free Vertex Deletion Problem

Lito Goldmann, Leon Kellerhals, Tomohiro Koana

In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i\le j$, find a set of at most $k$ vertices that intersects every (not ne…