The computation of chromatic polynomials

The planar graph representing the truncated icosahedron is a cubic graph with 60 vertices and 90 edges. The computation of the chromatic polynomial of this graph is computed by enhancing the algorithm based on the classical Delete-Contract theorem as well as finding approaches for substantially modifying a computation tree during computation. The result itself is an interesting example of the time/space tradeoffs that are important in large computations.