The computation of chromatic polynomials

DOI10.1016/S0012-365X(98)00343-4MaRDI QIDQ1297452zbMATH OpenFDO

Authors Gary Haggard, Thomas R. Mathies

Publication date 9 August 1999

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(98)00343-4

zbMATH Keywords

algorithmchromatic polynomialcomputation treetruncated icosahedron

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Review text

The computation of the chromatic polynomial of the truncated icosahedron (a cubic planar graph with 60 vertices and 90 edges) is computed by enhancing the algorithm based on the classical delete-contract theorem.

Cites work

• An introduction to chromatic polynomials
• scientific article; zbMATH DE number 205347 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• On chromatic coefficients
• The Chromatic Polynomial of the Truncated Icosahedron

Cited in

(18)

• Chromatic polynomials and related topics. Proceedings of a conference, Shanghai, China, April 25--29, 1994
• A matrix method for chromatic polynomials
• Polychromatic sets and its application in simulating complex objects and systems
• DP color functions versus chromatic polynomials
• Using thresholds to compute chromatic polynomials.
• scientific article; zbMATH DE number 4181365 (Why is no real title available?)
• A Hodge decomposition interpretation for the coefficients of the chromatic polynomial
• scientific article; zbMATH DE number 5626056 (Why is no real title available?)
• scientific article; zbMATH DE number 4087683 (Why is no real title available?)
• scientific article; zbMATH DE number 1161304 (Why is no real title available?)
• scientific article; zbMATH DE number 205347 (Why is no real title available?)
• Finding the chromatic polynomial of Cayley graphs using the Tutte polynomial.
• scientific article; zbMATH DE number 6789180 (Why is no real title available?)
• scientific article; zbMATH DE number 6724468 (Why is no real title available?)
• Graph-Theoretic Concepts in Computer Science
• DP color functions versus chromatic polynomials (II)
• Approximating the chromatic polynomial of a graph
• Recursive formula for calculating the chromatic polynomial of a graph by vertex deletion

Describes a project that uses

Uses Software

• nauty

This page was built for publication: The computation of chromatic polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297452)