EntityQ512897· pop 10· linked from 22 articlesBrooks' theoremSign in to savetheorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degreeConnectionsgraph coloringEntitydigital object identifierEntitygraph theoryEntitygraphEntitybibcodeEntityMathWorldEntitycomplete graphEntityQ22908627EntityLászló LovászEntitydegreeEntityEric W. WeissteinEntityregular graphEntityspanning treeEntityEndre SzemerédiEntitycycle graphEntityNoga AlonEntitycliqueEntityedge coloringEntitygraph connectivity measureEntityneighbourhoodEntityCategoriesGraph coloringTheorems in graph theory