Intersection graphs of curves in the plane
From MaRDI portal
Cites work
Cited in
(56)- Irrepresentability by multiple intersection, or why the interval number is unbounded
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs. I: The number of critical nonstring graphs is infinite
- String graphs requiring exponential representations
- Optimal packing and covering in the plane are NP-complete
- Complexity of representation of graphs by set systems
- Comparability graphs and intersection graphs
- On grid intersection graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Thresholds for classes of intersection graphs
- The max clique problem in classes of string-graphs
- Classes and recognition of curve contact graphs
- Topological queries in spatial databases
- A special planar satisfiability problem and a consequence of its NP- completeness
- Simultaneous dominance representation of multiple posets
- On intersection representations of co-planar graphs
- The maximal clique and colourability of curve contact graphs
- On the complexity of finite subgraphs of the curve graph
- Decidability of string graphs
- A left-first search algorithm for planar graphs
- Conflict-free coloring of string graphs
- On some special classes of contact \(B_0\)-VPG graphs
- On dominating set of some subclasses of string graphs
- Embedding ray intersection graphs and global curve simplification
- Collision-free routing problem with restricted L-path
- Characterising circular-arc contact \(B_0\)-VPG graphs
- On strict (outer-)confluent graphs
- Coloring Hasse diagrams and disjointness graphs of curves
- On the speed of algebraically defined graph classes
- Planar graphs have 1-string representations
- Crossing patterns of semi-algebraic sets
- String graphs of k-bend paths on a grid
- On string graph limits and the structure of a typical string graph
- On the complexity of planar covering of small graphs
- Max point-tolerance graphs
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
- Intersection graphs of rays and grounded segments
- On the size of outer-string representations
- Outerstring graphs are -bounded
- Disjointness graphs of segments in the space
- String graphs and incomparability graphs
- Disjoint edges in complete topological graphs
- Crossing patterns of segments
- Turán-type results for partial orders and intersection graphs of convex sets
- Separability, boxicity, and partial orders
- Proper colorability of segment intersection graphs
- Proper colorability of segment intersection graphs
- Graphs of intersections of closed polygonal chains
- An algorithm for the maximum weight independent set problem on outerstring graphs
- Recognition and proper coloring of unit segment intersection graphs
- Constrained outer-string representations
- Sparse outerstring graphs have logarithmic treewidth
- Constrained outer-string representations
- String graph obstacles of high girth and of bounded degree
- Star-based separators for intersection graphs of c-colored pseudo-segments
- Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate
This page was built for publication: Intersection graphs of curves in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234300)
