The computation of chromatic polynomials

Abstract

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… (More)
DOI: 10.1016/S0012-365X(98)00343-4

Topics

3 Figures and Tables

Slides referencing similar topics