On the degree-chromatic polynomial of a tree

From MaRDI portal
Publication:5377364




Abstract: 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.









This page was built for publication: On the degree-chromatic polynomial of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377364)