Bounding clique-width via perfect graphs (Q2424685)

From MaRDI portal
Revision as of 13:34, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(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
    25 June 2019
    0 references
    zbMATH Keywords
    clique-width
    0 references
    forbidden induced subgraphs
    0 references
    graph class
    0 references
    cites work
    Q3286847
    0 references
    Q4425939
    0 references
    Q5387674
    0 references
    Q4489221
    0 references
    Q5487903
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C60
    0 references
    05C69
    0 references
    05C12
    0 references
    zbMATH DE Number
    7073051
    0 references
    OpenAlex ID
    W2623827933
    0 references
    arXiv ID
    1406.6298
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2424685&oldid=39073597"
    Powered by MediaWiki