scientific article; zbMATH DE number 3981198
From MaRDI portal
Publication:3745859
Recommendations
Cited in
(24)- String graphs. II: Recognizing string graphs is NP-hard
- String graphs. I: The number of critical nonstring graphs is infinite
- String graphs requiring exponential representations
- Thresholds for classes of intersection graphs
- The max clique problem in classes of string-graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- On intersection representations of co-planar graphs
- Splitting a graph into disjoint induced paths or cycles.
- Decidability of string graphs
- String shuffle: circuits and graphs
- Subexponential-time algorithms for finding large induced sparse subgraphs
- Almost all string graphs are intersection graphs of plane convex sets
- On string graph limits and the structure of a typical string graph
- scientific article; zbMATH DE number 4142090 (Why is no real title available?)
- scientific article; zbMATH DE number 1936578 (Why is no real title available?)
- Almost all string graphs are intersection graphs of plane convex sets
- String graphs and incomparability graphs
- String graphs and incomparability graphs
- Refining the hierarchies of classes of geometric intersection graphs
- Proper colorability of segment intersection graphs
- Proper colorability of segment intersection graphs
- An algorithm for the maximum weight independent set problem on outerstring graphs
- Recognition and proper coloring of unit segment intersection graphs
- String graph obstacles of high girth and of bounded degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745859)
