Complexity of clique coloring and related problems (Q551168): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:57, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of clique coloring and related problems |
scientific article |
Statements
Complexity of clique coloring and related problems (English)
0 references
14 July 2011
0 references
clique coloring
0 references
choosability
0 references
complexity
0 references
polynomial hierarchy
0 references
