For any finite set $\mathcal{H} = \{H_1,\ldots,H_p\}$ of graphs, a graph is $\mathcal{H}$-subgraph-free if it does not contain any of $H_1,\ldots,H_p$ as a subgraph. Similar to known meta-classifications for the minor and topological minor relations, we give a meta-classification for the subgraph relation. Our framework classifies if problems are "efficiently solvable" or "computationally hard" for $\mathcal{H}$-subgraph-free graphs. The conditions are that the problem should be efficiently solvable on graphs of bounded treewidth, computationally hard on subcubic graphs, and computational hardness is preserved under edge subdivision. We show that all problems satisfying these conditions are efficiently solvable if $\mathcal{H}$ contains a disjoint union of one or more paths and subdivided claws, and are computationally hard otherwise. To illustrate the broad applicability of our framework, we study partitioning, covering and packing problems, network design problems and width parameter problems. We apply the framework to obtain a dichotomy between polynomial-time solvability and NP-completeness. For other problems we obtain a dichotomy between almost-linear-time solvability and having no subquadratic-time algorithm (conditioned on some hardness hypotheses). Along the way we unify and strengthen known results from the literature.

翻译：对于任何限定的 $\ mathcal{H} = $H_ 1,\ldot, H_ p ⁇ $ 图表中, 图表如果不包含任何$H_ 1,\ldots, H_p$, 以子图形式显示, 任何限定的 $mathcal{H} = $H_ 1,\ldots, H_p ⁇ $ 图表中, 图表是$mathcalcal{H} 或“ compendation 硬性” 的, 图表是免费的。 对于图表中不包含任何 $H_ 1,\\\ ldcaldcal{H} 的, 图表是无偏差的, 图表是 $\\ mathalcalcalcal- liformissional deality corrilations, 问题都是有效的。 我们的研究框架中所有满足这些条件的问题都是可以高效的, 如果$\mathcal cal {H} 包含一条或多条路径的不相交的不相交的路径和分解的路径, 和分解的路径, 并进行计算, rodeal deal deal deal deal deal rution rolational roal roal rution robil