Stretch-width
From MaRDI portal
Cites work
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- A logic-based algorithmic meta-theorem for mim-width
- Approximating highly inapproximable problems on graphs of bounded twin-width
- Approximating rank-width and clique-width quickly
- Coloring circle graphs
- Deciding twin-width at most 4 is NP-complete
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- Induced subgraphs and tree decompositions. III. Three-path-configurations and logarithmic treewidth
- Linear time solvable optimization problems on graphs of bounded clique-width
- Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes
- On the complexity of k-SAT
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Treewidth of graphs with balanced separations
- Twin-width II: small classes
- Twin-width IV: ordered graphs and matrices
- Twin-width. I: Tractable FO model checking
- Twin-width. VI: The lens of contraction sequences
- Which problems have strongly exponential complexity?
This page was built for publication: Stretch-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926202)
