Worst-case analysis of Read's chromatic polýnomial algorithm

Ars Combinatoria

Volumn 46, Issue , 1997, Pages 145-151

  Walsh, Timothy R ^a  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041182408     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Wokingham, Berkshire, U.K., 1974.
2. L. Moser and M. Wyman, An asymptotic formula for the Bell numbers, Transactions of the Royal Society of Canada, Volume XLIX, Series III, Section 3 (1955), 49-54.
3. R. Read, An introduction to chromatic polynomials, Journal of Combinatorial Theory 4 (1968), 51-71.
4. J. Riordan, An Introduction to Combinatorial Analysis, J. Wiley and Sons, New York and London, 1958.
5. D.R. Shier and N. Chandrasekharan, Algorithms for computing the chromatic polynomial, Journal of Combinatorial Mathematics and Combinatorial Computing 4 (1988), 213-222.