The theorem is named after R. Leonard Brooks, who published a proof of it in 1941. A coloring with the number of colors described by Brooks' theorem is...

all other cases, the bound can be slightly improved; Brooks' theorem states that Brooks' theorem: χ ( G ) ≤ Δ ( G ) {\displaystyle \chi (G)\leq \Delta...

combinatorial games, and the proofs of other mathematical results including Brooks' theorem on the relation between coloring and degree. Other concepts in graph...

exactly 1. By Brooks' theorem, any graph G other than a clique or an odd cycle has chromatic number at most Δ(G), and by Vizing's theorem any graph has...

In calculus, Taylor's theorem gives an approximation of a k {\textstyle k} -times differentiable function around a given point by a polynomial of degree...

{\displaystyle G} . When G {\displaystyle G} is not an odd cycle or a clique, Brooks' theorem states that the upper bound can be reduced to Δ ( G ) {\displaystyle...

In database theory, the CAP theorem, also named Brewer's theorem after computer scientist Eric Brewer, states that any distributed data store can provide...

Stokes' theorem, also known as the Kelvin–Stokes theorem after Lord Kelvin and George Stokes, the fundamental theorem for curls or simply the curl theorem, is...

{\displaystyle n=k} vertices, or an odd-length cycle graph. This is Brooks' theorem. 2 m ≥ ( k − 1 ) n + k − 3 {\displaystyle 2m\geq (k-1)n+k-3} . 2 m...

In mathematics, specifically in real analysis, the Bolzano–Weierstrass theorem, named after Bernard Bolzano and Karl Weierstrass, is a fundamental result...