teorema de Brooks
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 ★
Comum · Saberes
teorema de Brooks
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.
Último preço
—
Preço mínimo
—
Mediana 7 d
—
Vendas 30 d
0
Faixa 30 d
—
Em circulação
0
Cotação
mediana
mín – máx
vendas
Sem vendas no período
Ver tabela
| Data | mediana | Mín | Máx | vendas |
|---|
Histórico de vendas
- Última venda
- —
- Média 30 d
- —
- Mínima 30 d
- —
- Máxima 30 d
- —
- Vendas 7 d
- 0
- Vendas 30 d
- 0
Ainda sem vendas.
Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Vectorisation: BethNaught. Original: Claudio Rocchini (User:... (CC BY 2.5) ·
Cartas próximas
Grau (teoria dos grafos)
Nº Q383444 ★★
Teorema das quatro cores
Nº Q184410 ★★★
teorema de Bézout
Theorem calculating the number of intersection points of two algebraic curves in terms of their degrees
Nº Q1542114 ★
Grafo de Cayley
Nº Q859174 ★★
teorema de Kirchhoff
Theorem of computing the number of spanning trees in a graph
Nº Q2226691 ★★
polinômio cromático
Polynomial defined from a node-link graph, that counts the number of graph colorings as a function of the number of colors
Nº Q1087609 ★