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}
}
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
1 Citations
18 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Algorithms for computing the chromatic polynomial

  • D. R Shier, N. Chandrasekharan
  • Journal of Combinatorial Mathematics and…
  • 1988
Highly Influential
4 Excerpts

Exact chromatic polynomials for toroidal chain of complete graphs

  • S-C. Chang
  • Physica A, 313:397–426,
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…