The degree chromatic polynomial Pm(G,k) of a graph G counts the number of k-colorings in which no vertex has m adjacent vertices of its same color. We prove Humpert and Martin's conjecture on the leading terms of the degree chromatic polynomial of a tree.
Federico Ardila, Department of Mathematics, San Francisco State University
"On the Degree-Chromatic Polynomial of a Tree,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 12
, Article 5.
Available at: http://scholar.rose-hulman.edu/rhumj/vol12/iss2/5