Chromatic numbers of abelian Cayley graphs (Michael Krebs, Cal State LA)
Roberts North 102, CMCA classic problem in graph theory is to find the chromatic number of a given graph: that is, to find the smallest number of colors needed to assign every vertex […]