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
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.
Nº Q512897 ★
Common · Knowledge
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
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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. A coloring with the number of colors described by Brooks' theorem is sometimes called a Brooks coloring or a Δ-coloring.
Text: Wikipédia, CC BY-SA 4.0. · Image: Vectorisation: BethNaught. Original: Claudio Rocchini (User:... (CC BY 2.5) ·
Related cards
Four color theorem
Statement in mathematics
Nº Q184410 ★★★
Bézout's theorem
Theorem calculating the number of intersection points of two algebraic curves in terms of their degrees
Nº Q1542114 ★
Cayley graph
Graph whose vertices and edges represent the elements of a group and their products with the generators of the group
Nº Q859174 ★★
Kirchhoff's theorem
Theorem of computing the number of spanning trees in a graph
Nº Q2226691 ★★
Green's theorem
Line integral around a closed curve to a double integral over its enclosed region
Nº Q321237 ★★★
Hall's marriage theorem
Theorem that a finite bipartite graph has a perfect matching iff any subset of vertices from one group has a neighbourhood of equal or greater size
Nº Q536640 ★