DOAJ Open Access 2012

On the degree-chromatic polynomial of a tree

Diego Cifuentes

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (1)

Diego Cifuentes

Format Sitasi

APA MLA BibTeX

Cifuentes, D. (2012). On the degree-chromatic polynomial of a tree. https://doi.org/10.46298/dmtcs.3020

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3020

Informasi Jurnal

Tahun Terbit: 2012
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3020
Akses: Open Access ✓