The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs.
Jungho AhnSeonghyuk ImSang-il OumPublished in: CoRR (2022)
Keyphrases
- bipartite graph
- np complete
- conflict free
- maximum matching
- functional dependencies
- randomly generated
- np hard
- computational complexity
- satisfiability problem
- link prediction
- database schemes
- bipartite graph matching
- phase transition
- maximum cardinality
- multivalued dependencies
- argumentation frameworks
- random walk
- optimal solution
- learning algorithm