Graphs with small chromatic numbers are easy to color (Q1116349): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90200-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000890568 / rank | |||
Normal rank | |||
Revision as of 18:34, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with small chromatic numbers are easy to color |
scientific article |
Statements
Graphs with small chromatic numbers are easy to color (English)
0 references
1989
0 references
A polynomial time graph coloring algorithm is presented with the following property: there is a constant \(c>0\) such that if \(k=k(n)\) is a function such that \(k\leq \sqrt{c n/\log n}\), then the algorithm colors optimally almost all graphs with n vertices and chromatic number less than or equal to k.
0 references
probabilistic analysis of algorithms
0 references
polynomial time algorithm
0 references
graph coloring
0 references
chromatic number
0 references
