research
∙
08/17/2022
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
A proper coloring of a graph is proper conflict-free if every non-isolat...
share
research
∙
12/21/2018
