Recommendations
- Crossings of complex line segments
- Intersection patterns of curves
- Crossings in grid drawings
- Alternating paths along axis-parallel segments
- Crossing Numbers and Cutwidths
- Alternating paths through disjoint line segments
- Intersecting designs
- Graph Drawing
- Quantitative restrictions on crossing patterns
Cites work
- A left-first search algorithm for planar graphs
- A positive fraction Erdős-Szekeres theorem
- Crossing-Free Subgraphs
- Graphs drawn with few crossings per edge
- scientific article; zbMATH DE number 66689 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1552836 (Why is no real title available?)
- scientific article; zbMATH DE number 1775439 (Why is no real title available?)
- scientific article; zbMATH DE number 3223507 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- Intersection graphs of curves in the plane
- Intersection graphs of segments
- Lower Bounds for Approximation by Nonlinear Manifolds
- Multivariate regression depth
- Not all graphs are segment \(T\)-graphs
- On a problem of K. Zarankiewicz
- On the Betti Numbers of Real Varieties
- String graphs requiring exponential representations
- String graphs. II: Recognizing string graphs is NP-hard
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
Cited in
(23)- Vertex-minors and the Erdős-Hajnal conjecture
- On the speed of algebraically defined graph classes
- Crossings of complex line segments
- Crossing patterns of semi-algebraic sets
- On disjoint crossing families in geometric graphs
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Block Crossings in Storyline Visualizations
- Dependent random choice
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 1786524 (Why is no real title available?)
- A Bipartite Strengthening of the Crossing Lemma
- Algorithms and Data Structures
- Turán-type results for partial orders and intersection graphs of convex sets
- String graphs have the Erdős-Hajnal property
- Strong Erdős-Hajnal properties in chordal graphs
- New bounds for the same-type lemma
- A structure theorem for pseudo-segments and its applications
- Enumeration of intersection graphs of x-monotone curves
- A structure theorem for pseudosegments and its applications
- Pivot-minors and the Erdős-Hajnal conjecture
- A bipartite analogue of Dilworth's theorem
- On the obfuscation complexity of planar graphs
- A bipartite strengthening of the crossing Lemma
This page was built for publication: Crossing patterns of segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953378)
