An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure

Shinwoo An, Seonghyuk Im, Seokbeom Kim +1

Given a family $\mathcal{F}$ of graphs, a graph is \emph{$\mathcal{F}$-subgraph-free} if it has no subgraph isomorphic to a member of $\mathcal{F}$. We present a fixed-parameter li…