The following pages link to Decidability of string graphs (Q1887714):
Displayed 20 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)
- Note on the pair-crossing number and the odd-crossing number (Q938304) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q2189736) (← links)
- Blocks of Hypergraphs (Q3000508) (← links)
- Computing the Fréchet Distance Between Polygons with Holes (Q3448855) (← links)
- Folding and Spiralling: The Word View (Q3503458) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Hanani--Tutte and Hierarchical Partial Planarity (Q5058130) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q5116528) (← links)
- Bad drawings of small complete graphs (Q5206933) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Refining the hierarchies of classes of geometric intersection graphs (Q5892293) (← links)
- General lower bounds for the minor crossing number of graphs (Q5962348) (← links)