Farrell polynomials on graphs of bounded tree width (Q1398293): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4952623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the Tutte polynomials of graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical foundations of computer science 1997. 22nd international symposium, MFCS '97, Bratislava, Slovakia, August 25--29, 1997. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte Polynomial for Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Defining a Relation on a Finite Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results for the Martin polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to matching polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a general class of graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of the matching polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique polynomials and independent set polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parametrized complexity of knot polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph characterising polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le Polynôme De Martin D'un Graphe Eulerien / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995745 / rank
 
Normal rank

Latest revision as of 18:31, 5 June 2024

scientific article
Language Label Description Also known as
English
Farrell polynomials on graphs of bounded tree width
scientific article

    Statements

    Farrell polynomials on graphs of bounded tree width (English)
    0 references
    0 references
    0 references
    29 July 2003
    0 references
    graph polynomials
    0 references
    generating functions
    0 references
    combinatorial enumeration
    0 references
    computational complexity
    0 references
    Farrell polynomials
    0 references
    definability
    0 references
    monadic second-order logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers