On the Computational Complexity of the Forcing Chromatic Number (Q5454241)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Computational Complexity of the Forcing Chromatic Number |
scientific article; zbMATH DE number 5255540
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computational Complexity of the Forcing Chromatic Number |
scientific article; zbMATH DE number 5255540 |
Statements
On the Computational Complexity of the Forcing Chromatic Number (English)
0 references
28 March 2008
0 references
computational complexity
0 references
complexity classes
0 references
combinatorial forcing
0 references
chromatic number of a graph
0 references
unique satisfiability
0 references
