Pages that link to "Item:Q3058296"
From MaRDI portal
The following pages link to A Separator Theorem for String Graphs and its Applications (Q3058296):
Displaying 26 items.
- On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- Ramsey numbers of cubes versus cliques (Q519968) (← links)
- Zarankiewicz's problem for semi-algebraic hypergraphs (Q721064) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- A sharp threshold phenomenon in string graphs (Q2066317) (← links)
- On grids in topological graphs (Q2249043) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Many touchings force many crossings (Q2312603) (← links)
- Acyclic subgraphs of planar digraphs (Q2517654) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems (Q3466342) (← links)
- Many Touchings Force Many Crossings (Q4625108) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- (Q5116474) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)
- Applications of a New Separator Theorem for String Graphs (Q5414146) (← links)
- Near-Optimal Separators in String Graphs (Q5414151) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)
