On the colored Tutte polynomial of a graph of bounded treewidth

  • Authors:
  • Lorenzo Traldi

  • Affiliations:
  • Department of Mathematics, Lafayette College, Easton, PA

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2006

Quantified Score

Hi-index 0.04

Visualization

Abstract

We observe that a formula given by Negami [Polynomial invariants of graphs, Trans. Amer. Math. Soc. 299 (1987) 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynomial. Consequently, an algorithm of Andrzejak [An algorithm for the Tutte polynomials of graphs of bounded treewidth, Discrete Math. 190 (1998) 39-54] may be directly adapted to compute the colored Tutte polynomial of a graph of bounded treewidth in polynomial time. This result has also been proven by Makowsky [Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width, Discrete Appl. Math. 145 (2005) 276-290], using a different algorithm based on logical techniques.