The following pages link to (Q3745859):
Displaying 18 items.
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- The max clique problem in classes of string-graphs (Q1201270) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Decidability of string graphs (Q1887714) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- (Q4406419) (← links)
- String graphs and incomparability graphs (Q5891424) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Refining the hierarchies of classes of geometric intersection graphs (Q5892293) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)
- Proper colorability of segment intersection graphs (Q6571282) (← links)
