Farrell polynomials on graphs of bounded tree width
type: Item
instance of: scholarly article
title: Farrell polynomials on graphs of bounded tree width
zbMATH Open document ID: 1023.68070
DOI: 10.1016/S0196-8858(02)00530-4
author: J. P. Mariño
author: Johann A. Makowsky
published in: Advances in Applied Mathematics
publication date: 2003-07-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 1956064
zbMATH Keywords: graph polynomials
zbMATH Keywords: generating functions
zbMATH Keywords: combinatorial enumeration
zbMATH Keywords: computational complexity
zbMATH Keywords: Farrell polynomials
zbMATH Keywords: definability
zbMATH Keywords: monadic second-order logic
MaRDI profile type: Publication
cites work: Q4952623
cites work: Easy problems for tree-decomposable graphs
cites work: An algorithm for the Tutte polynomials of graphs of bounded treewidth
cites work: Mathematical foundations of computer science 1997. 22nd international symposium, MFCS '97, Bratislava, Slovakia, August 25--29, 1997. Proceedings
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: Q3960732
cites work: A Tutte Polynomial for Coloured Graphs
cites work: The Complexity of Defining a Relation on a Finite Graph
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures
cites work: Q4715442
cites work: Q4850061
cites work: New results for the Martin polynomial
cites work: Q3883524
cites work: An introduction to matching polynomials
cites work: On a general class of graph polynomials
cites work: Dependence polynomials
cites work: Q3043192
cites work: Q4198056
cites work: On the theory of the matching polynomial
cites work: Problems in algebraic combinatorics
cites work: Clique polynomials and independent set polynomials of graphs
cites work: Matching theory
cites work: Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width
cites work: Q4325781
cites work: The parametrized complexity of knot polynomials
cites work: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
cites work: Q4298260
cites work: Graph characterising polynomials
cites work: Q3243274
cites work: Q5510191
cites work: Q3748279
cites work: The complexity of computing the permanent
cites work: Le Polynôme De Martin D'un Graphe Eulerien
cites work: Q3140234
cites work: Q3995745
Recommended article: Q4502591
Recommended article: Q4789198
Recommended article: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Recommended article: Fubini numbers and polynomials of graphs
Recommended article: Tree-Related Widths of Graphs and Hypergraphs
Recommended article: Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Recommended article: An algorithm for the Tutte polynomials of graphs of bounded treewidth
Recommended article: Evaluating a weighted graph polynomial for graphs of bounded tree-width
Recommended article: On the colored Tutte polynomial of a graph of bounded treewidth
Recommended article: Q4838483
description: scientific article; zbMATH DE number 1956064