Proof of a conjectured lower bound on the chromatic number of a graph (Q745214)

From MaRDI portal
Revision as of 02:54, 10 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
Proof of a conjectured lower bound on the chromatic number of a graph
scientific article

    Statements

    title
    Proof of a conjectured lower bound on the chromatic number of a graph (English)
    0 references
    author
    Tsuyoshi Ando
    0 references
    Minghua Lin
    0 references
    publication date
    13 October 2015
    0 references
    zbMATH Keywords
    chromatic number
    0 references
    lower bound
    0 references

    Identifiers

    zbMATH DE Number
    6493740
    0 references
    OpenAlex ID
    W1149759637
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q745214&oldid=38472650"
    Powered by MediaWiki