On the degree-chromatic polynomial of a tree

Diego Cifuentes

doi:10.46298/dmtcs.3020

Diego Cifuentes - 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) - https://doi.org/10.46298/dmtcs.3020

On the degree-chromatic polynomial of a treeConference paper

Authors: Diego Cifuentes ¹

1 Departamento de Matematicas [Univ de los Andes Colombia]

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.

https://doi.org/10.46298/dmtcs.3020

Source: 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

Imported on: January 31, 2017

Keywords: chromatic polynomial, graph coloring, tree,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

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

Bibliographic References

Share and export

Consultation statistics