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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.