How well can a graph be n-colored? (Q1148324): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q92200966, #quickstatements; #temporary_batch_1705791795597 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q92200966 / rank | |||
Normal rank | |||
Revision as of 01:07, 21 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How well can a graph be n-colored? |
scientific article |
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
