Q512897

From Wikidata
Jump to: navigation, search

Brooks' theorem(Q512897)

theorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree
    No aliases defined
[edit]
Language Label Description Also known as
English
Brooks' theorem
theorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree

    Statements

    /m/05b2qcb
    1 reference
    0 references
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]