Brooks' theorem (Q512897)

From Wikidata
Jump to: navigation, search
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
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

    0 references

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit