Bounding Clique-Width via Perfect Graphs (Q2799217)

From MaRDI portal
Revision as of 17:10, 16 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bounding Clique-Width via Perfect Graphs
scientific article

    Statements

    title
    Bounding Clique-Width via Perfect Graphs (English)
    0 references
    author
    Konrad K. Dabrowski
    0 references
    Shenwei Huang
    0 references
    Daniël Paulusma
    0 references
    publication date
    8 April 2016
    0 references
    zbMATH Keywords
    clique-width
    0 references
    forbidden induced subgraphs
    0 references
    graph class
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C69
    0 references
    05C17
    0 references
    05C60
    0 references
    zbMATH DE Number
    6566816
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2799217&oldid=3125603"
      Powered by MediaWiki