Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs

The authors present efficient algorithms for computing the matching polynomial and chromatic polynomial of a series-parallel graph in O(n/sup 3/) and O(n/sup 2/) time respectively. Their algorithm for computing the matching polynomial generalizes an existing result from Lovasz, Plummer (1986) and the chromatic polynomial algorithm improves the result given by Hunt, Ravi, Stearn (1988) from O(n/sup 4/) time.<
>