The complexity of \(G\)-free colourability (Q1356726)
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: The complexity of \(G\)-free colourability |
scientific article; zbMATH DE number 1019082
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of \(G\)-free colourability |
scientific article; zbMATH DE number 1019082 |
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
0.90598655
0 references
0.9024864
0 references
0.9024864
0 references
0.9008703
0 references
0.8987018
0 references
0.89727783
0 references
0.8945174
0 references
0.8936832
0 references
0.8933253
0 references
0.8921969
0 references
