On the cover polynomial of a digraph
Journal of Combinatorial Theory Series B
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Concrete Math
The vertex-cover polynomial of a graph
Discrete Mathematics
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science
A Tutte Polynomial for Coloured Graphs
Combinatorics, Probability and Computing
A Two-Variable Interlace Polynomial
Combinatorica
The interlace polynomial of a graph
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science
The enumeration of vertex induced subgraphs with respect to the number of components
European Journal of Combinatorics
| Hi-index | 0.00 |
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gn be a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Ribò have proven linear recurrences with polynomial coefficients for the Tutte polynomials T(Gi, x, y) = T(Gi), i.e. T(Gn+r) = p1(x, y)T(Gn+r-1) + . . . + pr(x, y)T(Gn). We show that such linear recurrences hold much more generally for a wide class of graph polynomials (also of labeled or signed graphs), namely they hold for all the extended MSOL-definable graph polynomials. These include most graph and knot polynomials studied in the literature.