K. Dohmen, A. Pönitz and P. Tittmann [K. Dohmen, A. Pönitz, P. Tittmann, A new two-
variable generalization of the chromatic polynomial, Discrete Mathematics and Theoretical …

Inspired by the study of community structure in connection networks, we introduce the graph
polynomial Q (G; x, y), the bivariate generating function which counts the number of …

We consider a graph polynomial ξ (G; x, y, z) introduced by Ilia Averbouch, BennyGodlin,
and Johann A. Makowsky (2008). This graph polynomial simultaneously generalizes the …

The cover polynomial and its geometric version introduced by Chung & Graham and
D'Antona & Munarini, respectively, are two-variate graph polynomials for directed graphs …

Partition functions and graph polynomials have found many applications in combinatorics,
physics, biology and even the mathematics of finance. Studying their complexity poses some …

The cover polynomials are bivariate graph polynomials that can be defined as weighted
sums over all path-cycle covers of a graph. In [3], a dichotomy result for the cover …

Inspired by the study of community structure in connection networks, we introduce the graph
polynomial Q\left(G;x,y\right), as a bivariate generating function which counts the number of …

We outline a general approach to providing intensional models for languages with
computational effects, whereby the problem of interpreting a given effect reduces to that of …

The Tutte polynomial is surely the most studied graph polynomial, particularly when all of its
many specializations, generalizations, and applications are included. The impact of the Tutte …

In this chapter we explore the complexity of exactly computing the Tutte polynomial and its
evaluations for graphs and matroids in various models of computation. The Turing …