The proper conflict-free \(k\)-coloring problem and the odd \(k\)-coloring problem are NP-complete on bipartite graphs (Q6928025)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8095531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The proper conflict-free \(k\)-coloring problem and the odd \(k\)-coloring problem are NP-complete on bipartite graphs |
scientific article; zbMATH DE number 8095531 |
Statements
The proper conflict-free \(k\)-coloring problem and the odd \(k\)-coloring problem are NP-complete on bipartite graphs (English)
0 references
17 September 2025
0 references
proper conflict-free coloring
0 references
odd coloring
0 references
bipartite graph
0 references
planar graph
0 references
NP-completeness
0 references
0 references
