The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of partitioning into disjoint cliques and a triangle-free graph |
scientific article |
Statements
The complexity of partitioning into disjoint cliques and a triangle-free graph (English)
0 references
15 March 2017
0 references
graph coloring
0 references
NP-completeness
0 references
