A nearly complete complexity map of parity-constrained graph colourings: for two, three, and four-plus colours, almost every constraint combination is NP-complete, with ∨⋆ for q≥3 left open.
10 LenoreCowen, WayneGoddard, andC.EstherJesurum
1 Pith paper cite this work, alongside 617 external citations. Polarity classification is still indexing.
1
Pith paper citing it
617
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Complexity Classification of Colouring Problems with Parity Constraints
A nearly complete complexity map of parity-constrained graph colourings: for two, three, and four-plus colours, almost every constraint combination is NP-complete, with ∨⋆ for q≥3 left open.