The complexity of \(G\)-free colourability (Q1356726): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:27, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of \(G\)-free colourability |
scientific article |
Statements
The complexity of \(G\)-free colourability (English)
0 references
5 November 1998
0 references
chromatic number
0 references
2-colourable
0 references
polynomial time algorithm
0 references
bipartition
0 references
NP-complete
0 references
