Skip to search formSkip to main contentSkip to account menu

Crossing number (graph theory)

Known as: 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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

44 relations
1-planar graphAlbertson conjectureAngular resolution (graph drawing)Approximation algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
SPITZER AS A MICROLENS PARALLAX SATELLITE: MASS MEASUREMENT FOR THE OGLE-2014-BLG-0124L PLANET AND ITS HOST STAR
We combine Spitzer and ground-based observations to measure the microlens parallax vector , and thus the mass and distance of… 
Highly Cited
2008
Highly Cited
2008
Electron densities in the upper ionosphere of Mars from the excitation of electron plasma oscillations
[1] In addition to remote radio sounding of the ionosphere of Mars, the MARSIS (Mars Advanced Radar for Subsurface and… 
Highly Cited
2007
Highly Cited
2007
Using eye tracking to investigate graph layout effects
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing… 
Highly Cited
2001
Highly Cited
2001
Topological Horseshoes
When does a continuous map have chaotic dynamics in a set Q? More specifically, when does it factor over a shift on M symbols… 
Highly Cited
1998
Highly Cited
1998
Which Crossing Number Is It Anyway?
A drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to each edge a simple continuous arc… 
Highly Cited
1997
Highly Cited
1997
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
We show that an old but not well-known lower bound for the crossing number of a graph yields short proofs for a number of bounds… 
Highly Cited
1996
Highly Cited
1996
Geometry and physics of knots
KNOTS are usually categorized in terms of topological properties that are invariant under changes in a knot's spatial… 
Highly Cited
1995
Highly Cited
1995
Transfers of Meaning
L'A. examine les transferts de significations en anglais, operation dans laquelle des noms de propriete sont transferes dans de… 
1988
1988
Cubic graphs with crossing number two
It is proved that every cubic graph with crossing number at least two contains a subdivision of one of eight graphs. 
Highly Cited
1981
Highly Cited
1981
New lower bound techniques for VLSI
  • F. Leighton
  • 22nd Annual Symposium on Foundations of Computer…
  • 1981
  • Corpus ID: 6478819
In this paper, we use crossing number and wire area arguments to find lower bounds on the layout area and maximum edge length of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)