How well can a graph be n-colored? (Q1148324)

From MaRDI portal
Revision as of 10:51, 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
How well can a graph be n-colored?
scientific article

    Statements

    title
    How well can a graph be n-colored? (English)
    0 references
    publication date
    1981
    0 references
    zbMATH DE Number
    3706476
    0 references
    zbMATH Keywords
    n-colourability coefficient of a graph
    0 references
    NP-complete problem
    0 references
    Stirling number of the second kind
    0 references
    equicoloured complete graph
    0 references
    Erdős-graph
    0 references
    Wikidata QID
    Q92200966
    0 references
    OpenAlex ID
    W1983592887
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1148324&oldid=37162188"
    Powered by MediaWiki