2-subcoloring is NP-complete for planar comparability graphs (Q2404616)
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 6776062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2-subcoloring is NP-complete for planar comparability graphs |
scientific article; zbMATH DE number 6776062 |
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
0.8757144808769226
0 references
0.8750104904174805
0 references
0.8749856352806091
0 references
