TOPICS
Search

Q-Chromatic Polynomial


The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined for graphs with chromatic number chi>=3 by

 Q(u)=(pi(u+3))/(u(u+1)(u+2)(u+3)).

Its definition is motivated by the fact that pi(0)=pi(1)=pi(2)=0 for any graph with chromatic number chi>2, meaning dividing out the corresponding terms x(x-1)(x-2) from pi(x) provides a more compact representation than pi(x) since Q(u) has a smaller coefficients. When chi>3, Q(u) is a polynomial of degree n-4 (instead of n) for a graph with vertex count n, and in the case where chi=3, it is a polynomial in u of degree n-4 plus a term involving u^(-1) (Birkhoff and Lewis 1946).


See also

Chromatic Polynomial

Explore with Wolfram|Alpha

References

Bari, R. A. "Chromatically Equivalent Graphs." In Graphs and Combinatorics (Ed. R. A. Bari and F. Harary). Berlin: Springer-Verlag, pp. 186-200, 1974.Birkhoff, G. D. and Lewis, D. C. "Chromatic Polynomials." Trans. Amer. Math. Soc. 60, 355-451, 1946.

Cite this as:

Weisstein, Eric W. "Q-Chromatic Polynomial." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Q-ChromaticPolynomial.html

Subject classifications