Matches in DBpedia 2014 for { ?s ?p In graph theory, Brooks' theorem states a relationship between the maximum degree of a graph and its chromatic number. According to the theorem, in a connected graph in which every vertex has at most Δ neighbors, the vertices can be colored with only Δ colors, except for two cases, complete graphs and cycle graphs of odd length, which require Δ + 1 colors.The theorem is named after R. Leonard Brooks, who published a proof of it in 1941.. }
Showing items 1 to 1 of
1
with 100 items per page.
- Brooks'_theorem comment "In graph theory, Brooks' theorem states a relationship between the maximum degree of a graph and its chromatic number. According to the theorem, in a connected graph in which every vertex has at most Δ neighbors, the vertices can be colored with only Δ colors, except for two cases, complete graphs and cycle graphs of odd length, which require Δ + 1 colors.The theorem is named after R. Leonard Brooks, who published a proof of it in 1941.".