Pages that link to "Item:Q1234300"
From MaRDI portal
The following pages link to Intersection graphs of curves in the plane (Q1234300):
Displaying 50 items.
- Max point-tolerance graphs (Q344833) (← links)
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate (Q992595) (← links)
- Irrepresentability by multiple intersection, or why the interval number is unbounded (Q1065021) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← links)
- String graphs requiring exponential representations (Q1121918) (← links)
- Optimal packing and covering in the plane are NP-complete (Q1157170) (← links)
- Complexity of representation of graphs by set systems (Q1158768) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- On grid intersection graphs (Q1174140) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- The max clique problem in classes of string-graphs (Q1201270) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- Topological queries in spatial databases (Q1305920) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- Simultaneous dominance representation of multiple posets (Q1362580) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- On the complexity of finite subgraphs of the curve graph (Q1626407) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Decidability of string graphs (Q1887714) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- On some special classes of contact \(B_0\)-VPG graphs (Q2064288) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Collision-free routing problem with restricted L-path (Q2161235) (← links)
- Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- Planar graphs have 1-string representations (Q2380780) (← links)
- Crossing patterns of semi-algebraic sets (Q2566809) (← links)
- String graphs of k-bend paths on a grid (Q2840697) (← links)
- On String Graph Limits and the Structure of a Typical String Graph (Q2978181) (← links)
- On the Complexity of Planar Covering of Small Graphs (Q3104767) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
- (Q5116474) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Disjoint edges in complete topological graphs (Q5917904) (← links)
- Crossing patterns of segments (Q5953378) (← links)
- Separability, boxicity, and partial orders (Q6139870) (← links)
- Proper colorability of segment intersection graphs (Q6571282) (← links)
- Graphs of intersections of closed polygonal chains (Q6669632) (← links)
