Abstract
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
... read more