The following pages link to (Q3348944):
Displaying 30 items.
- Max point-tolerance graphs (Q344833) (← links)
- The clique problem in ray intersection graphs (Q377488) (← links)
- Segment representation of a subclass of co-planar graphs (Q418892) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- On the stability number of the edge intersection of two graphs. (Q1853063) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid (Q3104787) (← links)
- Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (Q3467876) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- (Q5088986) (← links)
- On plane subgraphs of complete topological drawings (Q5156010) (← links)
- Intersection graphs of homothetic polygons (Q5301023) (← links)
- Efficient Local Representations of Graphs (Q5506777) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- Many disjoint edges in topological graphs (Q5890932) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Covering and packing of triangles intersecting a straight line (Q5918763) (← links)
- Many disjoint edges in topological graphs (Q5919826) (← links)
