Pönitz, André - In: Mathematics and Computers in Simulation (MATCOM) 49 (1999) 3, pp. 179-191
Many graph invariants (chromatic number, rook polynomial, Tutte polynomial, etc.) are known to be computable for general graphs in exponential time only. Algorithms for their computation usually depend on special properties of the invariants and are not extendable to slightly different problems.