Graph Homomorphism, Monotone Classes and Bounded Pathwidth
Graph Homomorphism, Monotone Classes and Bounded Pathwidth
A recent paper describes a framework for studying the computational complexity of graph problems on monotone classes, that is those omitting a set of graphs as a subgraph. If the problems lie in the framework, and many do, then the computational complexity can be described for all monotone classes defined …