The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
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