Cifuentes, Diego - On the degree-chromatic polynomial of a tree

dmtcs:3020 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
On the degree-chromatic polynomial of a tree

Authors: Cifuentes, Diego

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 : oai:HAL:hal-01283152v1
Volume: DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Section: Proceedings
Published on: January 1, 2012
Submitted on: January 31, 2017
Keywords: chromatic polynomial, graph coloring, tree,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Consultation statistics

This page has been seen 49 times.
This article's PDF has been downloaded 122 times.