2-subcoloring is NP-complete for planar comparability graphs (Q2404616)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-subcoloring is NP-complete for planar comparability graphs |
scientific article |
Statements
2-subcoloring is NP-complete for planar comparability graphs (English)
0 references
19 September 2017
0 references
computational complexity
0 references
graph coloring
0 references
NP-completeness
0 references
