In 2000, Steingrimsson introduced the coloring complex of a graph, and then in 2005, Jonsson proved that the homology of the coloring complex of a simple graph is concentrated at top degree. In this talk, we will discuss a relationship between the dimensions of the cyclic homology groups of the coloring complex of a simple, connected graph, G, and the coefficient of the linear term of the chromatic polynomial of G. For more information, please visit our website: http://www.brynmawr.edu/math/colloquium.shtml