![]() |
Discrete Mathematics & Theoretical Computer Science |
The degree chromatic polynomial $P_m(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.
Source : ScholeXplorer
IsRelatedTo ARXIV 1012.4786 Source : ScholeXplorer IsRelatedTo DOI 10.1137/110820075 Source : ScholeXplorer IsRelatedTo DOI 10.46298/dmtcs.2930 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1012.4786
|