On-line coloring \(k\)-colorable graphs (Q1264277): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Henry A. Kierstead / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Chris Jagger / rank | |||
Normal rank | |||
Revision as of 17:34, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line coloring \(k\)-colorable graphs |
scientific article |
Statements
On-line coloring \(k\)-colorable graphs (English)
0 references
18 March 1999
0 references
In this paper it is shown that for any \(k\), there exists an on-line algorithm that will colour any \(k\)-colourable graph on \(n\) vertices with \(O(n^{1-1/k!})\) colours, improving the previous bound of \(O(n\log^{(2k- 3)}n/\log^{(2k- 4)}n)\). For \(k= 3\) and \(k= 4\) it is possible to do even better.
0 references
coloring
0 references
on-line algorithm
0 references
