Pages that link to "Item:Q1121918"
From MaRDI portal
The following pages link to String graphs requiring exponential representations (Q1121918):
Displaying 24 items.
- Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces (Q464617) (← links)
- Spiraling and folding: the word view (Q548656) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q2189736) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- Segment representations with small resolution (Q2338214) (← links)
- Untangling two systems of noncrossing curves (Q2630858) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- (Q5116474) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q5116528) (← links)
- Drawing Simultaneously Embedded Graphs with Few Bends (Q6066464) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)
