Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Crossing_number_(graph_theory)> ?p ?o }
- Crossing_number_(graph_theory) subject Category:Inequalities.
- Crossing_number_(graph_theory) subject Category:Topological_graph_theory.
- Crossing_number_(graph_theory) hypernym Number.
- Crossing_number_(graph_theory) type Algorithm.
- Crossing_number_(graph_theory) type Inequality.
- Crossing_number_(graph_theory) type Infographic.
- Crossing_number_(graph_theory) type Invariant.
- Crossing_number_(graph_theory) type Object.
- Crossing_number_(graph_theory) type Proof.
- Crossing_number_(graph_theory) type Relation.
- Crossing_number_(graph_theory) type Theorem.
- Crossing_number_(graph_theory) comment "In graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph is planar if and only if its crossing number is zero.The mathematical origin of the study of crossing numbers is in Turán's brick factory problem, in which Pál Turán asked to determine the crossing number of the complete bipartite graph Km,n.".
- Crossing_number_(graph_theory) label "Crossing number (graph theory)".
- Crossing_number_(graph_theory) sameAs Q266775.
- Crossing_number_(graph_theory) sameAs Número_de_cruce_(teoría_de_grafos).
- Crossing_number_(graph_theory) sameAs Metszési_szám_(gráfelmélet).
- Crossing_number_(graph_theory) sameAs m.04cx07j.
- Crossing_number_(graph_theory) sameAs Число_пересечений_(теория_графов).
- Crossing_number_(graph_theory) sameAs Priesečníkové_číslo_(teória_grafov).
- Crossing_number_(graph_theory) sameAs Число_схрещувань.
- Crossing_number_(graph_theory) sameAs Q266775.
- Crossing_number_(graph_theory) sameAs 交叉數.
- Crossing_number_(graph_theory) wasDerivedFrom Crossing_number_(graph_theory)?oldid=705531294.
- Crossing_number_(graph_theory) depiction 3-crossing_Heawood_graph.svg.
- Crossing_number_(graph_theory) isPrimaryTopicOf Crossing_number_(graph_theory).
