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.
23 Daniel Kobler and Udi Rotics
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Establishes tight n^{Theta(k^{d-1})} runtime bounds for d-Clique Packing parameterized by clique-width under ETH for fixed d >= 3.
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.
-
Tight bounds for clique-packing parameterized by clique-width
Establishes tight n^{Theta(k^{d-1})} runtime bounds for d-Clique Packing parameterized by clique-width under ETH for fixed d >= 3.