In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph
. Our method is based on the addition of edges and contraction of non-edges of
, the base case of the recursion being chordal graphs. The set of edges to be considered is taken from a triangulation of
. To achieve our goal, we use the properties of triangulations and clique-trees with respect to the previous operations, and guide our algorithm to efficiently divide the original problem.
Furthermore, we give some lower bounds of the general complexity of our method, and provide experimental results for several families of graphs.