Double-Partition Coloring problem: a unified approach for conflict-free coloring of hypergraphs and other coloring problems in graphs
The Double-Partition Coloring Problem (DPCP) is a recently introduced generalization of several coloring problems on graphs and hypergraphs, including the Partition Coloring Problem, the List Coloring Problem, and the Conflict-Free Coloring Problem (CFCP). In this work, we further investigate the structural and computa...