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.
    [edit]

    Statements

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