Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs.

N. Chandrasekharan Sridhar Hannenhalli Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs. 42-45 1992 conf/icci/1992 ICCI db/conf/icci/icci1992.html#ChandrasekharanH92