Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285)

From MaRDI portal
Revision as of 01:13, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Polynomial-time recognition of clique-width \(\leq 3\) graphs
scientific article

    Statements

    title
    Polynomial-time recognition of clique-width \(\leq 3\) graphs (English)
    0 references
    author
    Michel A. Habib
    0 references
    Jean-Marc Lanlignel
    0 references
    Udi Rotics
    0 references
    Derek Gordon Corneil
    0 references
    Bruce A. Reed
    0 references
    publication date
    11 May 2012
    0 references
    Mathematics Subject Classification ID
    05C69
    0 references
    05C70
    0 references
    05C85
    0 references
    zbMATH DE Number
    6033766
    0 references
    zbMATH Keywords
    clique-width computation
    0 references
    polynomial-time algorithm
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q415285&oldid=25568036"
    Powered by MediaWiki