Intersection patterns of curves
From MaRDI portal
Publication:5392191
Recommendations
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Coloring k k -free intersection graphs of geometric objects in the plane
- Separator theorems and Turán-type results for planar intersection graphs
- Ordered graphs and large bi-cliques in intersection graphs of curves
- scientific article; zbMATH DE number 1011262
- Triangle-free geometric intersection graphs with no large independent sets
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth
- Intersection graphs of halflines and halfplanes
- Turán-type results for partial orders and intersection graphs of convex sets
- String graphs requiring exponential representations
Cited in
(36)- A bipartite analogue of Dilworth's theorem for multiple partial orders
- A crossing lemma for Jordan curves
- On the number of touching pairs in a set of planar curves
- A sharp threshold phenomenon in string graphs
- Intersections and circuits in sets of line segments
- Intersection patterns of planar sets
- Space curves that intersect often
- Cusps of Characteristic Curves and Intersection-Aware Visualization of Path and Streak Lines
- Intersection Queries in Curved Objects
- k-quasi-planar graphs
- Curves in R^d intersecting every hyperplane at most d+1 times
- A Separator Theorem for String Graphs and Its Applications
- scientific article; zbMATH DE number 16600 (Why is no real title available?)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- scientific article; zbMATH DE number 1341903 (Why is no real title available?)
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Density theorems for intersection graphs of \(t\)-monotone curves
- Pairwise disjoint eight‐shaped curves in hybrid planes
- A Bipartite Strengthening of the Crossing Lemma
- On Planar Continuous Families of Curves
- Distances and Intersections of Curves
- Large homogeneous submatrices
- Helly-type problems
- String graphs and incomparability graphs
- Induced Ramsey-type theorems
- Crossing patterns of segments
- String graphs have the Erdős-Hajnal property
- Some properties of edge intersection graphs of single-bend paths on a grid
- Ramsey-type constructions for arrangements of segments
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Induced subgraph density. VI: Bounded VC-dimension
- A structure theorem for pseudo-segments and its applications
- A structure theorem for pseudosegments and its applications
- Erdős-Hajnal-type theorems in hypergraphs
- Intersection patterns of convex sets
- Intersections of lines and circles
This page was built for publication: Intersection patterns of curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392191)
