: Mathématiques: crossing number

graph theory > graph drawing > crossing number

crossing number

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. Determining the crossing number continues to be of great importance in graph drawing, as user studies have shown that drawing graphs with few crossings makes it easier for people to understand the drawing.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Crossing_number_(graph_theory))

http://data.loterre.fr/ark:/67375/PSR-VBR69RF6-C

RDF/XML TURTLE JSON-LD Dernière modification le 18/10/2024

Loterre