Jump to content

Brooks' theorem (Q512897)

From Wikidata
theorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree
edit
Language Label Description Also known as
default for all languages
No label defined
    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

      Identifiers

       
      edit
        edit
          edit
            edit
              edit
                edit
                  edit
                    edit