Pages that link to "Item:Q1121917"
From MaRDI portal
The following pages link to String graphs. I: The number of critical nonstring graphs is infinite (Q1121917):
Displaying 25 items.
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Generalized disk graphs (Q832849) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- String graphs of k-bend paths on a grid (Q2840697) (← links)
- On String Graph Limits and the Structure of a Typical String Graph (Q2978181) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- Efficient Local Representations of Graphs (Q5506777) (← links)
- Refining the hierarchies of classes of geometric intersection graphs (Q5892293) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- Recognizing string graphs in NP (Q5917583) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- General lower bounds for the minor crossing number of graphs (Q5962348) (← links)
