The following pages link to Intersection graphs of segments (Q1338319):
Displaying 50 items.
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- The clique problem in ray intersection graphs (Q377488) (← links)
- Segment representation of a subclass of co-planar graphs (Q418892) (← links)
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- The complexity of tensor rank (Q722207) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Representations by contact and intersection of segments (Q879951) (← links)
- On orthogonal ray trees (Q908312) (← links)
- Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate (Q992595) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Intersection graphs of halflines and halfplanes (Q1106247) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← 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)
- Stage-graph representations (Q1363763) (← links)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Drawing plane triangulations with few segments (Q1622344) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Intersection graphs of rays and grounded segments (Q1687911) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Forced pairs in \(A\)-Stick graphs (Q2144508) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Segment representations with small resolution (Q2338214) (← links)
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs (Q2376078) (← links)
- Vertex intersection graphs of paths on a grid: characterization within block graphs (Q2409505) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
- String graphs of \(k\)-bend paths on a grid (Q2840697) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- Order-Preserving 1-String Representations of Planar Graphs (Q2971141) (← links)
- On the Complexity of the Planar Slope Number Problem (Q2971391) (← links)
- (Q3043724) (← links)
- The Number of Bits Needed to Represent a Unit Disk Graph (Q3057635) (← links)
- A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
- Intersection Graphs of Pseudosegments: Chordal Graphs (Q3075604) (← links)
- On the Complexity of Planar Covering of Small Graphs (Q3104767) (← links)
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid (Q3104787) (← links)
