The following pages link to Decidability of string graphs (Q5175975):
Displaying 12 items.
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- Topological graphs with no large grids (Q2573803) (← links)
- Drawing interactive Euler diagrams from region connection calculus specifications (Q2629218) (← links)
- Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search (Q2938524) (← links)
- (Q4006543) (← links)
- Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System (Q4989173) (← links)
- (Q5116474) (← links)
- Crossing Numbers and Parameterized Complexity (Q5452207) (← links)
- String graphs and incomparability graphs (Q5891424) (← links)
- Recognizing string graphs in NP (Q5917583) (← links)