chromatic polynomial of an undirected graph
undirected graph or network
variable in chromatic poly (usually number of colors)
Important: The networks package has been deprecated. Use the superseding command GraphTheory[ChromaticPolynomial] instead.
This routine returns the chromatic polynomial of the graph G as a polynomial in lambda. The value of this polynomial gives the number of proper vertex-colorings of G using lambda colors.
The procedure is normally loaded via the command with(networks) but can also be referenced using the full name networks[chrompoly](...).
Download Help Document
What kind of issue would you like to report? (Optional)