Jul 2026
Closing the Complexity Gap for Exact Domatic Number at Three and Four
Exact-k-DNP is DP-complete for every fixed k>= 3, completing the fixed-value classification from k = 3 onward and giving explicit graph gadgets whose local domination constraints encode truth assignments and clause satisfaction.
Holger Spakowski
· arXiv.org · 1 citation