Using thresholds to compute chromatic polynomials

Ars Combinatoria

Volumn 58, Issue , 2001, Pages 85-95

  Haggard, Gary ^a   Mathies, Thomas R ^b  

^a BUCKNELL UNIVERSITY   (United States)

^b KNOX COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (14)

1. Martin H.G. Anthony, Computing chromatic polynomials, Ars Combin. 29C (1990), 216-220.
2. Stephen Guattery, Gary Haggard and Ronald C. Read, Chromatically Equivalent Cycles of Ladders, private communication.
3. Gary Haggard, Computing Chromatic Polynomials of Large Graphs, Congressus Numerantium 119, 1996, pp.113-122.
4. Gary Haggard, Computing Chromatic Polynomials of Large Graphs I, The Journal of Combinatorial Mathematics and Combinatorial Computing, 1993(13), pp.175-186.
5. Gary Haggard, Spanning Trees and Vertex Deletion, Congressus Numerantium 112 (1995), pp. 33-36.
6. Gary Haggard and Thomas R. Mathies, The computation of chromatic polynomials, Discrete Mathematics 199 (1999), pp. 227-231.
7. Gary Haggard and R.C. Read, Isomorphism Abstract Data Type for Small Graphs, Caribbean Journal of Mathematics and Computer Science 3 (1 & 2), (1993), 35-43.
8. D. W. Hall, J. W. Siry, and B. R. Vanderslice, The Chromatic Polynomial of the Truncated Icosahedron, Proceedings of the American Mathematical Society (1965), 620-628.
9. B. D. McKay, nauty User's Guide (Version 1.5), Technical Report , TR-CS-90-02, Australian National University, Department of Computer Science, 1990.
10. A. Nijenhuis and H.S. Wilf, Combinatorial Algorithms, Academic Press, New York (1975).
11. Ronald Read, An improved method for computing the chromatic polynomials of sparse graphs, Research Report CORR 87-20, Dept. of Comb. and Optim., U. of Waterloo, 1987.
12. D. R. Shier and N. Chandrasekharan, Algorithms for computing chromatic polynomials, J. Combin. Math. Combin. Comput. 4 (1988), 213-222.
13. Timothy R. Walsh, Worst-Case Analysis of Read's Chromatic Polynomial Algorithm, Ars Combinatoria 46 (1997), pp. 145-151.
14. Herbert S. Wilf, Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ (1986).