Extends O(ln² Δ) upper bound to partial list closed-neighborhood conflict-free chromatic number of graphs and establishes NP-hardness for list open/closed neighborhood variants.
Pliable index coding via conflict-free colorings of hypergraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bounds and Hardness Results for Conflict-free Choosability
Extends O(ln² Δ) upper bound to partial list closed-neighborhood conflict-free chromatic number of graphs and establishes NP-hardness for list open/closed neighborhood variants.