Complexity Classification of Forbidden Subgraph Problems: Edge Subdivision and the "H"-Graphs

The paper studies the complexity of graph problems that are solvable in polynomial time on graph classes of bounded treewidth and NP-complete on subcubic graphs, but whose NP-hardness is not preserved under edge subdivision. It provides a rich complexity landscape for such problems on H-subgraph-free graph classes.