Sparse outerstring graphs have logarithmic treewidth
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5035595 (Why is no real title available?)
- A bipartite analogue of Dilworth's theorem
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- A separator theorem for string graphs and its applications
- An algorithm for the maximum weight independent set problem on outerstring graphs
- Approximability of packing disjoint cycles
- Approximation algorithms and hardness results for cycle packing problems
- Clique-based separators for geometric intersection graphs
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Computing list homomorphisms in geometric intersection graphs
- Computing maximum independent set on outerstring graphs and their relatives
- Cops and robbers on intersection graphs
- Decidability of string graphs
- Faster algorithms for cycle hitting problems on disk graphs
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
- Induced subgraphs and tree decompositions. III. Three-path-configurations and logarithmic treewidth
- Intersection graphs of curves in the plane
- Intersection graphs of rays and grounded segments
- Near-optimal separators in string graphs
- On the size of outer-string representations
- On the tree-width of even-hole-free graphs
- Optimality program in segment and string graphs
- Outerstring graphs are -bounded
- Parameterized algorithms
- Separators in region intersection graphs
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
- String graphs and incomparability graphs
- String graphs and separators
- String graphs. I: The number of critical nonstring graphs is infinite
- Subexponential Parameterized algorithms on disk graphs (extended abstract)
- Subexponential algorithms for variants of the homomorphism problem in string graphs
- The Complexity of Coloring Circular Arcs and Chords
- The Hamiltonian circuit problem for circle graphs is NP-complete
- The balanced connected subgraph problem for geometric intersection graphs
- The clique problem in ray intersection graphs
- The complexity of domination problems in circle graphs
- Topology of Thin Film RC Circuits
- Treewidth of graphs with balanced separations
- Vertex disjoint paths for dispatching in railways
- Weakly transitive orientations, Hasse diagrams and string graphs
This page was built for publication: Sparse outerstring graphs have logarithmic treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253061)
