Approximating the Chromatic Polynomial of a Graph
Nai Wei Lin
Department of Computer Science
University of Arizona The
Tucson AZ
naiwei cs arizona edu
Abstract
The problem of computing the chromatic p olynomial of a graph is P hard This pap er
presents an approximation algorithm for computing the chromatic p olynomial of a graph
2 2