  Let G(n,d) be the random d-regular graph on n vertices. For any integer k
exceeding a certain constant k_0 we identify a number d_{k-col} such that
G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if
d>d_{k-col}.
