Coloring k-colorable graphs using relatively small palettes.

Eran Halperin Ram Nathaniel Uri Zwick Coloring k-colorable graphs using relatively small palettes. 72-90 2002 45 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00217-1 db/journals/jal/jal45.html#HalperinNZ02