On the colored Tutte polynomial of a graph of bounded treewidth

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.

[1]  Johann A. Makowsky,et al.  Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width , 2001, SODA '01.

[2]  Joseph E. Bonin,et al.  Tutte polynomials of generalized parallel connections , 2004, Adv. Appl. Math..

[3]  Thomas Zaslavsky,et al.  Strong Tutte functions of matroids and graphs , 1992 .

[4]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[5]  Steven D. Noble,et al.  Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width , 1998, Combinatorics, Probability and Computing.

[6]  Torben Hagerup,et al.  Parallel Algorithms with Optimal Speedup for Bounded Treewidth , 1995, SIAM J. Comput..

[7]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[8]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[9]  James G. Oxley,et al.  A note on Negami's polynomial invariants for graphs , 1989, Discret. Math..

[10]  E. S.D.NOBL.  Evaluating the Tutte Polynomial for Graphs of Bounded TreeWidth , 2022 .

[11]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[12]  James G. Oxley,et al.  Matroid theory , 1992 .

[13]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[14]  Seiya Negami,et al.  Polynomial invariants of graphs , 1987 .

[15]  Béla Bollobás,et al.  A Tutte Polynomial for Coloured Graphs , 1999 .

[16]  Béla Bollobás,et al.  A Tutte Polynomial for Coloured Graphs , 1999, Combinatorics, Probability and Computing.

[17]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[18]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[19]  Artur Andrzejak,et al.  An algorithm for the Tutte polynomials of graphs of bounded treewidth , 1998, Discret. Math..

[20]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[21]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[22]  Tom Brylawski,et al.  A decomposition for combinatorial geometries , 1972 .

[23]  Lorenzo Traldi,et al.  Parametrized Tutte Polynomials of Graphs and Matroids , 2006, Combinatorics, Probability and Computing.

[24]  Artur Andrzejak,et al.  Splitting Formulas for Tutte Polynomials , 1997, J. Comb. Theory, Ser. B.

[25]  N. White.  Theory of Matroids , 2008 .