Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Brooks'_theorem> ?p ?o. }
Showing items 1 to 45 of
45
with 100 items per page.
- Brooks'_theorem abstract "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.".
- Brooks'_theorem thumbnail Graph_exact_coloring.gif?width=300.
- Brooks'_theorem wikiPageExternalLink citation.cfm?id=314613.314829.
- Brooks'_theorem wikiPageID "21042117".
- Brooks'_theorem wikiPageRevisionID "574937545".
- Brooks'_theorem authorlink "Bruce Reed".
- Brooks'_theorem authorlink "László Lovász".
- Brooks'_theorem authorlink "Vadim G. Vizing".
- Brooks'_theorem first "Bruce".
- Brooks'_theorem first "László".
- Brooks'_theorem first "Vadim".
- Brooks'_theorem hasPhotoCollection Brooks'_theorem.
- Brooks'_theorem last "Lovász".
- Brooks'_theorem last "Reed".
- Brooks'_theorem last "Vizing".
- Brooks'_theorem title "Brooks' Theorem".
- Brooks'_theorem urlname "BrooksTheorem".
- Brooks'_theorem year "1975".
- Brooks'_theorem year "1976".
- Brooks'_theorem year "1999".
- Brooks'_theorem subject Category:Graph_coloring.
- Brooks'_theorem subject Category:Theorems_in_graph_theory.
- Brooks'_theorem type Abstraction100002137.
- Brooks'_theorem type Communication100033020.
- Brooks'_theorem type Message106598915.
- Brooks'_theorem type Proposition106750804.
- Brooks'_theorem type Statement106722453.
- Brooks'_theorem type Theorem106752293.
- Brooks'_theorem type TheoremsInDiscreteMathematics.
- 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.".
- Brooks'_theorem label "Brooks' theorem".
- Brooks'_theorem label "Satz von Brooks".
- Brooks'_theorem label "Teorema de Brooks".
- Brooks'_theorem label "Théorème de Brooks".
- Brooks'_theorem label "Теорема Брукса".
- Brooks'_theorem sameAs Satz_von_Brooks.
- Brooks'_theorem sameAs Teorema_de_Brooks.
- Brooks'_theorem sameAs Théorème_de_Brooks.
- Brooks'_theorem sameAs m.05b2qcb.
- Brooks'_theorem sameAs Q512897.
- Brooks'_theorem sameAs Q512897.
- Brooks'_theorem sameAs Brooks'_theorem.
- Brooks'_theorem wasDerivedFrom Brooks'_theorem?oldid=574937545.
- Brooks'_theorem depiction Graph_exact_coloring.gif.
- Brooks'_theorem isPrimaryTopicOf Brooks'_theorem.