Mixed graph coloring is W[1]-hard parameterized by treewidth and paraNP-hard by neighborhood diversity, but FPT parameterized by the introduced mixed neighborhood diversity.
Journal of Algorithms , volume =
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5verdicts
UNVERDICTED 5representative citing papers
Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
Classifies the classical and parameterized complexity of vertex-identification problems to chordal graph subclasses, with an almost complete picture for parameters k and n-k.
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
Model checking for low-monodimensionality fragments of CMSO with disjoint-paths predicate is FPT on topological-minor-free graph classes.
citing papers explorer
-
The Parameterized Complexity of Coloring Mixed Graphs
Mixed graph coloring is W[1]-hard parameterized by treewidth and paraNP-hard by neighborhood diversity, but FPT parameterized by the introduced mixed neighborhood diversity.
-
Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
-
Identification to Subclasses of Chordal Graphs
Classifies the classical and parameterized complexity of vertex-identification problems to chordal graph subclasses, with an almost complete picture for parameters k and n-k.
-
Maximizing Reachability via Shifting of Temporal Paths
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
-
Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
Model checking for low-monodimensionality fragments of CMSO with disjoint-paths predicate is FPT on topological-minor-free graph classes.