Pages that link to "Item:Q5414146"
From MaRDI portal
The following pages link to Applications of a New Separator Theorem for String Graphs (Q5414146):
Displaying 34 items.
- On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
- Zarankiewicz's problem for semi-algebraic hypergraphs (Q721064) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← 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)
- Characterization of 2-path signed network (Q2221636) (← links)
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors (Q2256590) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- On String Graph Limits and the Structure of a Typical String Graph (Q2978181) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- Two-Planar Graphs Are Quasiplanar (Q5111262) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)
- Near-Optimal Separators in String Graphs (Q5414151) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- Ramsey properties of semilinear graphs (Q6161733) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem (Q6563995) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
- Coloring triangle-free L-graphs with \(O(\log\log n)\) colors (Q6621266) (← links)
