Q512897

From Wikidata
Jump to: navigation, search

Brooks' theorem (Q512897)[edit]

theorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree [edit]

No aliases defined.
    [add]

    Statements

    /m/05b2qcb
    [edit]
    1 reference
    [add]
    [edit]
    0 references
    [add]
    Language Code Linked page
    Deutsch dewiki [edit]
    English enwiki [edit]
    español eswiki [edit]
    فارسی fawiki [edit]
    français frwiki [edit]
    magyar huwiki [edit]
    русский ruwiki [edit]
    [add]
    [add]
    [add]
    [add]
    [add]
    [add]