On an upper bound of the graph's chromatic number, depending on the graph's degree and density (Q1229732)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On an upper bound of the graph's chromatic number, depending on the graph's degree and density
scientific article

    Statements

    On an upper bound of the graph's chromatic number, depending on the graph's degree and density (English)
    0 references
    1977
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references