The recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial. c 2002 Elsevier Science B.V. A...
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky [Trans. Amer. Math. Soc. 334 (1992), 317-347] and Bollob