On-line coloring of perfect graphs
An algorithm is presented which colors on-line \(k\)-colorable perfect graphs with \(n^{10/\log\log n}\) colors. By modifying Vishwanathan's construction a \(\bigl(\log_3 n\bigr)^{k-1}/2^k k^{k-1}\) lower bound is given.
scientific article; zbMATH DE number 1102604