Fair MSO1 problems are W[1]-hard parameterized by cluster vertex deletion in general, but admit FPT algorithms under a sufficient condition that includes fair feedback vertex set, vertex cover, dominating set, and odd cycle transversal.
Algorithmic meta-theorems for restrictions of treewidth
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Introduces H-clique-width as a hereditary generalization of clique-width via induced subgraphs in strong products and reformulates planar product theorems under induced containment.
citing papers explorer
-
Fair Vertex Problems Parameterized by Cluster Vertex Deletion
Fair MSO1 problems are W[1]-hard parameterized by cluster vertex deletion in general, but admit FPT algorithms under a sufficient condition that includes fair feedback vertex set, vertex cover, dominating set, and odd cycle transversal.
-
Hereditary Graph Product Structure and $\cal H$-clique-width
Introduces H-clique-width as a hereditary generalization of clique-width via induced subgraphs in strong products and reformulates planar product theorems under induced containment.