ChromaticPolynomial
ChromaticPolynomial[g,k]
gives the chromatic polynomial of the graph g.
ChromaticPolynomial[{vw,…},…]
uses rules vw to specify the graph g.
Details
- ChromaticPolynomial[g,k] gives the number of vertex colorings of g with k colors.
- ChromaticPolynomial[g] gives a pure function representation of the chromatic polynomial of g.
Examples
open allclose allScope (6)
ChromaticPolynomial works with undirected graphs:
Applications (3)
Properties & Relations (3)
Use TuttePolynomial to compute ChromaticPolynomial:
A graph with vertices is a tree if and only if its chromatic polynomial is k(k-1)n-1:
Text
Wolfram Research (2014), ChromaticPolynomial, Wolfram Language function, https://reference.wolfram.com/language/ref/ChromaticPolynomial.html (updated 2015).
CMS
Wolfram Language. 2014. "ChromaticPolynomial." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/ChromaticPolynomial.html.
APA
Wolfram Language. (2014). ChromaticPolynomial. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/ChromaticPolynomial.html