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

From MaRDI portal
Revision as of 21:50, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    Ilya Averbouch
    0 references
    Benny Godlin
    0 references
    Johann A. Makowsky
    0 references
    Udi Rotics
    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
    OpenAlex ID
    W1524888420
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3522957&oldid=32052613"
    Powered by MediaWiki