Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs

Vadim Lozin, Barnaby Martin, Sukanya Pandey +4

For a fixed set $\mathcal{H}$ of graphs, a graph $G$ is $\mathcal{H}$-subgraph-free if $G$ does not contain any $H\in \mathcal{H}$ as a (not necessarily induced) subgraph. A recently propo…