On the degree-chromatic polynomial of a tree

Details On the degree-chromatic polynomial of a tree On the degree-chromatic polynomial of a tree

2011-06-30

arxiv.org/abs/1107.0060v1

Mathematics

Combinatorics

3 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the degree-chromatic polynomial of a tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the degree-chromatic polynomial of a tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the degree-chromatic polynomial of a tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-480065