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

From MaRDI portal
Revision as of 11:19, 21 June 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
Polynomial-time recognition of clique-width \(\leq 3\) graphs
scientific article

    Statements

    Polynomial-time recognition of clique-width \(\leq 3\) graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references

    Identifiers