# Computation of Chromatic Polynomials Using Triangulations and Clique Trees

@inproceedings{Berthom2005ComputationOC, title={Computation of Chromatic Polynomials Using Triangulations and Clique Trees}, author={Pascal Berthom{\'e} and Sylvain Lebresne and Kim Nguyen}, booktitle={WG}, year={2005} }

- Published 2005 in WG
DOI:10.1007/11604686_32

In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of G, the base case of the recursion being chordal graphs. The set of edges to be considered is taken from a triangulation of G. 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… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

1 Citations

18 References

Similar Papers