A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth
[chapter]
2014
Lecture Notes in Computer Science
We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph H and an input graph G, the task is to find a set X ⊆ V (G) of minimum size that hits all subgraphs of G isomorphic to H. In the colorful variant of the problem, each vertex of G is precolored with some color from V (H) and we require to hit only H-subgraphs with matching colors. Standard techniques shows that for every fixed H, the problem is fixed-parameter tractable parameterized by the
doi:10.1007/978-3-662-44465-8_17
fatcat:ev7cwnlwqveadmur24qmsntehy