The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1512.02207 / rank | |||
Normal rank | |||
Revision as of 14:36, 18 April 2024
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
