How well can a graph be n-colored? (Q1148324)
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: How well can a graph be n-colored? |
scientific article; zbMATH DE number 3706476
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How well can a graph be n-colored? |
scientific article; zbMATH DE number 3706476 |
Statements
How well can a graph be n-colored? (English)
0 references
1981
0 references
n-colourability coefficient of a graph
0 references
NP-complete problem
0 references
Stirling number of the second kind
0 references
equicoloured complete graph
0 references
Erdős-graph
0 references
