On grids in topological graphs
A topological graph G is a graph drawn in the plane with vertices represented by points and edges represented by continuous arcs connecting the vertices. If every edge is drawn as a straight-line segment, then G is called a geometric graph. A k-grid in a topological graph is a pair of subsets of the...
Main Authors: | Ackerman, Eyal, Fox, Jacob, Pach, János, Suk, Andrew |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | en_US |
Published: |
Elsevier
2017
|
Online Access: | http://hdl.handle.net/1721.1/110635 |
Similar Items
-
The Number of Edges in k-Quasi-planar Graphs
by: Fox, Jacob, et al.
Published: (2013) -
String graphs and incomparability graphs
by: Fox, Jacob, et al.
Published: (2015) -
Applications of a New Separator Theorem for String Graphs
by: Fox, Jacob, et al.
Published: (2015) -
A note on light geometric graphs
by: Ackerman, Eyal, et al.
Published: (2015) -
Erdos-Szekeres-type theorems for monotone paths and convex bodies
by: Fox, Jacob, et al.
Published: (2012)