On the degree-chromatic polynomial of a tree

MaRDI QIDQ5377364zbMATH OpenFDO

Authors Diego Cifuentes

Publication date 24 May 2019

Full work available at URL https://arxiv.org/abs/1107.0060, http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAR0107

zbMATH Keywords

treegraph coloringchromatic polynomial

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Connections of Hopf algebras with combinatorics (16T30)

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.

Recommendations

• On the degree-chromatic polynomial of a tree
• scientific article; zbMATH DE number 4195988
• Proof of a chromatic polynomial conjecture
• scientific article; zbMATH DE number 697169
• Colourings of (k-r,k)-trees

Cited in

(3)

• On the degree-chromatic polynomial of a tree
• scientific article; zbMATH DE number 5003360 (Why is no real title available?)
• The color-degree matrix and the number of multicolored trees in star decompositions

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)