Matches in DBpedia 2014 for { <http://dbpedia.org/resource/De_Bruijn–Erdős_theorem_(graph_theory)> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- De_Bruijn–Erdős_theorem_(graph_theory) abstract "In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and Paul Erdős (1951), states that, for every infinite graph G and finite integer k, G can be colored by k colors (with no two adjacent vertices having the same color) if and only if all of its finite subgraphs can be colored by k colors. That is, every k-critical graph (a graph that requires k colors but for which all subgraphs require fewer colors) must have a finite number of vertices.".
- De_Bruijn–Erdős_theorem_(graph_theory) wikiPageID "22728378".
- De_Bruijn–Erdős_theorem_(graph_theory) wikiPageRevisionID "569540137".
- De_Bruijn–Erdős_theorem_(graph_theory) author1Link "Nicolaas Govert de Bruijn".
- De_Bruijn–Erdős_theorem_(graph_theory) author2Link "Paul Erdős".
- De_Bruijn–Erdős_theorem_(graph_theory) first "Nicolaas Govert".
- De_Bruijn–Erdős_theorem_(graph_theory) first "Paul".
- De_Bruijn–Erdős_theorem_(graph_theory) last "Erdős".
- De_Bruijn–Erdős_theorem_(graph_theory) last "de Bruijn".
- De_Bruijn–Erdős_theorem_(graph_theory) year "1951".
- De_Bruijn–Erdős_theorem_(graph_theory) subject Category:Axiom_of_choice.
- De_Bruijn–Erdős_theorem_(graph_theory) subject Category:Graph_coloring.
- De_Bruijn–Erdős_theorem_(graph_theory) subject Category:Infinite_graphs.
- De_Bruijn–Erdős_theorem_(graph_theory) subject Category:Theorems_in_graph_theory.
- De_Bruijn–Erdős_theorem_(graph_theory) comment "In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and Paul Erdős (1951), states that, for every infinite graph G and finite integer k, G can be colored by k colors (with no two adjacent vertices having the same color) if and only if all of its finite subgraphs can be colored by k colors. That is, every k-critical graph (a graph that requires k colors but for which all subgraphs require fewer colors) must have a finite number of vertices.".
- De_Bruijn–Erdős_theorem_(graph_theory) label "De Bruijn–Erdős theorem (graph theory)".
- De_Bruijn–Erdős_theorem_(graph_theory) label "Théorème de De Bruijn-Erdős (théorie des graphes)".
- De_Bruijn–Erdős_theorem_(graph_theory) sameAs De_Bruijn%E2%80%93Erd%C5%91s_theorem_(graph_theory).
- De_Bruijn–Erdős_theorem_(graph_theory) sameAs Théorème_de_De_Bruijn-Erdős_(théorie_des_graphes).
- De_Bruijn–Erdős_theorem_(graph_theory) sameAs Q3527054.
- De_Bruijn–Erdős_theorem_(graph_theory) sameAs Q3527054.
- De_Bruijn–Erdős_theorem_(graph_theory) wasDerivedFrom De_Bruijn–Erdős_theorem_(graph_theory)?oldid=569540137.