##
###
Hitting forbidden subgraphs in graphs of bounded treewidth

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk

2017
*
Information and Computation
*

We study the complexity of a *generic* *hitting* problem H-Subgraph *Hitting*, where given a fixed pattern *graph* H and an input *graph* G, we seek for the minimum size of a set X ⊆ V (G) that *hits* all subgraphs ...
For the colorful variant, we demonstrate matching *upper* and lower *bounds* showing that the dependence of the running time *on* *treewidth* of G is tightly governed by µ(H), the maximum size of a minimal vertex ...
Classic results *on* model checking monadic second-order logic *on* *graphs* of *bounded* *treewidth*, such as Courcelle's Theorem, provide a unified and *generic* way of proving fixed-parameter tractability of most ...

doi:10.1016/j.ic.2017.04.009
fatcat:ajpyzikx2fbcldt6ltoqrpjsue