Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/De_Bruijn–Erdős_theorem_(graph_theory)> ?p ?o }
- De_Bruijn–Erdős_theorem_(graph_theory) type Redirect.
- De_Bruijn–Erdős_theorem_(graph_theory) type Theorem.
- 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.".
- De_Bruijn–Erdős_theorem_(graph_theory) label "De Bruijn–Erdős theorem (graph theory)".
- De_Bruijn–Erdős_theorem_(graph_theory) sameAs Q3527054.
- De_Bruijn–Erdős_theorem_(graph_theory) sameAs Teorema_de_De_Bruijn–Erdős_(teoria_de_grafs).
- 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 m.05zkpsm.
- 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=633907752.
- De_Bruijn–Erdős_theorem_(graph_theory) isPrimaryTopicOf De_Bruijn–Erdős_theorem_(graph_theory).