The following pages link to Recognizing string graphs in NP (Q5917583):
Displayed 13 items.
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Spiraling and folding: the word view (Q548656) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- Spatial reasoning in a fuzzy region connection calculus (Q835806) (← links)
- WORD EQUATIONS WITH ONE UNKNOWN (Q3086244) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Folding and Spiralling: The Word View (Q3503458) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- Word Equations with One Unknown (Q3637238) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- General lower bounds for the minor crossing number of graphs (Q5962348) (← links)