Publisher
Springer Science and Business Media LLC
Reference7 articles.
1. [B] A. Blum,New approximation algorithms for graph coloring, Journal of the Association for Computing Machinery31 (1994), 470–516.
2. [BK] A. Blum and D. Karger,An Õ(n 3/14 )-coloring for 3-colorable graphs, preprint.
3. [KK] H. Kierstead and K. Kolossa,On-line coloring of perfect graphs, Combinatorica, to appear.
4. [L] L. Lovász,Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest, 1993.
5. [LST] L. Lovász, M. Saks and W.T. Trotter,An online graph coloring algorithm with sublinear performance ratio, Discrete Mathematics75 (1989), 319–325.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献