On the degree-chromatic polynomial of a tree

zbMATH Open1412.05103arXiv1107.0060MaRDI QIDQ5377364FDOQ5377364

Authors: Diego Cifuentes 

Publication date: 24 May 2019

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.

Full work available at URL: https://arxiv.org/abs/1107.0060

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

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)

Cited In (3)

• On the degree-chromatic polynomial of a tree
• Title not available (Why is that?)
• 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)