Farrell polynomials on graphs of bounded tree width (Q1398293)

From MaRDI portal
Revision as of 17:31, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Farrell polynomials on graphs of bounded tree width
scientific article

    Statements

    title
    Farrell polynomials on graphs of bounded tree width (English)
    0 references
    author
    J. P. Mariño
    0 references
    Johann A. Makowsky
    0 references
    publication date
    29 July 2003
    0 references
    zbMATH Keywords
    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
    cites work
    Q4952623
    0 references
    Q3960732
    0 references
    Q4715442
    0 references
    Q4850061
    0 references
    Q3883524
    0 references
    Dependence polynomials
    0 references
    Q3043192
    0 references
    Q4198056
    0 references
    Matching theory
    0 references
    Q2768337
    0 references
    Q4325781
    0 references
    Q4298260
    0 references
    Q3243274
    0 references
    Q5510191
    0 references
    Q3748279
    0 references
    Q3140234
    0 references
    Q3995745
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q17
    0 references
    05C30
    0 references
    zbMATH DE Number
    1956064
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1398293&oldid=34344927"
    Powered by MediaWiki