The computation of chromatic polynomials (Q1297452)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computation of chromatic polynomials |
scientific article |
Statements
The computation of chromatic polynomials (English)
0 references
9 August 1999
0 references
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.
0 references
computation tree
0 references
chromatic polynomial
0 references
truncated icosahedron
0 references
algorithm
0 references
