An upper bound for the chromatic number of a graph and its application to timetabling problems (Q5524918)

From MaRDI portal
Revision as of 02:15, 24 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29302438, #quickstatements; #temporary_batch_1711234560214)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3237382
Language Label Description Also known as
English
An upper bound for the chromatic number of a graph and its application to timetabling problems
scientific article; zbMATH DE number 3237382

    Statements

    title
    An upper bound for the chromatic number of a graph and its application to timetabling problems (English)
    0 references
    author
    M. B. Powell
    0 references
    Dominic J. A. Welsh
    0 references
    publication date
    1967
    0 references
    zbMATH DE Number
    3237382
    0 references
    zbMATH Keywords
    numerical analysis
    0 references
    OpenAlex ID
    W2108301529
    0 references
    Wikidata QID
    Q29302438
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5524918&oldid=33197091"
    Powered by MediaWiki