From a zoo to a zoology: descriptive complexity for graph polynomials

Authors:
J. A. Makowsky
Affiliations:
Department of Computer Science, Technion–Israel Institute of Technology, Haifa, Israel
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 23
Cited 4

A Tutte polynomial for signed graphs

Discrete Applied Mathematics - Combinatorics and complexity
Tutte polynomials computable in polynomial time

Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
Complexity: knots, colourings and counting

Complexity: knots, colourings and counting
On the cover polynomial of a digraph

Journal of Combinatorial Theory Series B
Complexity and real computation

Complexity and real computation
Metafinite model theory

Information and Computation - Special issue: logic and computational complexity
An algorithm for the Tutte polynomials of graphs of bounded treewidth

Discrete Mathematics
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
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
Completeness classes in algebra

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The go polynomials of a graph

Theoretical Computer Science
The parametrized complexity of knot polynomials

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
A Tutte Polynomial for Coloured Graphs

Combinatorics, Probability and Computing
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width

Combinatorics, Probability and Computing
Chromatic Polynomials and the Symmetric Group

Graphs and Combinatorics
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
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
Matching Theory (North-Holland mathematics studies)

Matching Theory (North-Holland mathematics studies)
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Approximating rank-width and clique-width quickly

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity

Parameterized Complexity

On Counting Generalized Colorings

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
From Hilbert's program to a logic tool box

Annals of Mathematics and Artificial Intelligence
Tree-width in Algebraic Complexity

Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
The enumeration of vertex induced subgraphs with respect to the number of components

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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 generalizations of the Tutte polynomial, matching polynomials, interlace polynomials, and the cover polynomial of digraphs. We introduce the class of (hyper)graph polynomials definable in second order logic, and outline a research program for their classification in terms of definability and complexity considerations, and various notions of reducibilities.