How well can a graph be n-colored? (Q1148324): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On the Fundamental Problem of Mathematics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4194705 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(81)90023-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983592887 / rank | |||
Normal rank | |||
Latest revision as of 10:51, 30 July 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
