Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision

For a fixed set H of graphs, a graph G is H-subgraph-free if G does not contain any H∈H as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on H-subgraph-free graphs (for finite sets H) for problems that are solvable in polynomial time on graph classes of bounded treewidth, NP-complete on subcubic graphs, and whose NP-hardness is preserved under edge subdivision. While a lot of problems satisfy these conditions, there are also many problems that do not satisfy all three conditions and for which the complexity H-subgraph-free graphs is unknown.
In this paper, we study problems for which only the first two conditions of the framework hold (they are solvable in polynomial time on classes of bounded treewidth and NP-complete on subcubic graphs, but NP-hardness is not preserved under edge subdivision). In particular, we make inroads into the classification of the complexity of four such problems: k-Induced Disjoint Paths, C5-Colouring, Hamilton Cycle and Star 3-Colouring. Although we do not complete the classifications, we show that the boundary between polynomial time and NP-complete differs among our problems and differs from problems that do satisfy all three conditions of the framework. Hence, we exhibit a rich complexity landscape among problems for H-subgraph-free graph classes.