Graphs with small chromatic numbers are easy to color (Q1116349)
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: Graphs with small chromatic numbers are easy to color |
scientific article; zbMATH DE number 4088949
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with small chromatic numbers are easy to color |
scientific article; zbMATH DE number 4088949 |
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
