Pages that link to "Item:Q1864118"
From MaRDI portal
The following pages link to Recognizing string graphs is decidable (Q1864118):
Displaying 20 items.
- Spiraling and folding: the word view (Q548656) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- String graphs requiring exponential representations (Q1121918) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Folding and Spiralling: The Word View (Q3503458) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- (Q5116474) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- General lower bounds for the minor crossing number of graphs (Q5962348) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
