Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Crossing_number_(graph_theory)> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Crossing_number_(graph_theory) abstract "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 inTurán's brick factory problem, in which Pál Turán asked to determine the crossing number of the complete bipartite graph Km,n. However, the same problem of minimizing crossings was also considered in sociology at approximately the same time as Turán, in connection with the construction of sociograms. It continues to be of great importance in graph drawing.Without further qualification, the crossing number allows drawings in which the edges may be represented by arbitrary curves; the rectilinear crossing number requires all edges to be straight line segments, and may differ from the crossing number. In particular, the rectilinear crossing number of a complete graph is essentially the same as the minimum number of convex quadrilaterals determined by a set of n points in general position, closely related to the Happy Ending problem.".
- Crossing_number_(graph_theory) thumbnail 3-crossing_Heawood_graph.svg?width=300.
- Crossing_number_(graph_theory) wikiPageID "18298594".
- Crossing_number_(graph_theory) wikiPageRevisionID "599695208".
- Crossing_number_(graph_theory) hasPhotoCollection Crossing_number_(graph_theory).
- Crossing_number_(graph_theory) subject Category:Articles_containing_proofs.
- Crossing_number_(graph_theory) subject Category:Graph_drawing.
- Crossing_number_(graph_theory) subject Category:Graph_invariants.
- Crossing_number_(graph_theory) subject Category:Inequalities.
- Crossing_number_(graph_theory) subject Category:Topological_graph_theory.
- Crossing_number_(graph_theory) type Abstraction100002137.
- Crossing_number_(graph_theory) type Attribute100024264.
- Crossing_number_(graph_theory) type Cognition100023271.
- Crossing_number_(graph_theory) type Concept105835747.
- Crossing_number_(graph_theory) type Content105809192.
- Crossing_number_(graph_theory) type Difference104748836.
- Crossing_number_(graph_theory) type Feature105849789.
- Crossing_number_(graph_theory) type GraphInvariants.
- Crossing_number_(graph_theory) type Idea105833840.
- Crossing_number_(graph_theory) type Inequalities.
- Crossing_number_(graph_theory) type Inequality104752221.
- Crossing_number_(graph_theory) type Invariant105850432.
- Crossing_number_(graph_theory) type Property105849040.
- Crossing_number_(graph_theory) type PsychologicalFeature100023100.
- Crossing_number_(graph_theory) type Quality104723816.
- 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 inTurá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) label "交叉數".
- Crossing_number_(graph_theory) sameAs m.04cx07j.
- Crossing_number_(graph_theory) sameAs Q266775.
- Crossing_number_(graph_theory) sameAs Q266775.
- Crossing_number_(graph_theory) sameAs Crossing_number_(graph_theory).
- Crossing_number_(graph_theory) wasDerivedFrom Crossing_number_(graph_theory)?oldid=599695208.
- Crossing_number_(graph_theory) depiction 3-crossing_Heawood_graph.svg.
- Crossing_number_(graph_theory) isPrimaryTopicOf Crossing_number_(graph_theory).
