A new upper bound for the chromatic number of a graph (Q5444063)

From MaRDI portal
Revision as of 13:53, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q228794)
scientific article; zbMATH DE number 5238502
Language Label Description Also known as
English
A new upper bound for the chromatic number of a graph
scientific article; zbMATH DE number 5238502

    Statements

    A new upper bound for the chromatic number of a graph (English)
    0 references
    22 February 2008
    0 references
    vertex colouring
    0 references
    chromatic number upper bound
    0 references
    clique number
    0 references

    Identifiers