An algorithm for the Tutte polynomials of graphs of bounded treewidth Original Research Article

Let k be a fixed, positive integer. We give an algorithm which computes the Tutte polynomial of any graph G of treewidth at most k in time image, where c is twice the number of partitions of a set with 3k + 3 elements and n the number of vertices of G.