We give some necessary conditions for a graph to have chromatic number 3 in terms of the spectrum of the adjacency matrix. We apply these results to distance-regular graphs and determine for all known distance-regular graphs whether they are 3-chromatic.