Computing Graph Polynomials on Graphs of Bounded Clique-Width (Q3522957)

From MaRDI portal
Revision as of 23:49, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computing Graph Polynomials on Graphs of Bounded Clique-Width
scientific article

    Statements

    title
    Computing Graph Polynomials on Graphs of Bounded Clique-Width (English)
    0 references
    author
    Johann A. Makowsky
    0 references
    Udi Rotics
    0 references
    Ilya Averbouch
    0 references
    Benny Godlin
    0 references
    publication date
    4 September 2008
    0 references

    Identifiers

    DOI
    10.1007/11917496_18
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C70
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5321104
    0 references
    Wikidata QID
    Q56504780
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3522957&oldid=16887344"
    Powered by MediaWiki