The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385)

From MaRDI portal
Revision as of 10:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of some problems related to GRAPH 3-COLORABILITY
scientific article

    Statements

    title
    The complexity of some problems related to GRAPH 3-COLORABILITY (English)
    0 references
    author
    Andreas Brandstädt
    0 references
    Van Bang Le
    0 references
    Thomas Szymczak
    0 references
    publication date
    22 March 1999
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C15
    0 references
    zbMATH DE Number
    1267542
    0 references
    zbMATH Keywords
    graph 3-colorability problem
    0 references
    OpenAlex ID
    W2050157065
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1281385&oldid=37146756"
    Powered by MediaWiki