Stable graphs of bounded twin-width
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A Combinatorial Theorem for Trees
- A survey of -boundedness
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Factorization forests of finite height
- First-order interpretations of bounded expansion classes
- Grad and classes with bounded expansion. I: Decompositions
- Graph minors. I. Excluding a forest
- Graph minors. V. Excluding a planar graph
- Graphs of bounded cliquewidth are polynomially -bounded
- Induced subdivisions and bounded expansion
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Linear rankwidth meets stability
- Linear time algorithm for computing a small biclique in graphs without long induced paths
- Linear time solvable optimization problems on graphs of bounded clique-width
- Obstructions for bounded shrub-depth and rank-depth
- On the monadic second-order transduction hierarchy
- Second-order quantifiers and the complexity of theories
- Sparsity. Graphs, structures, and algorithms
- The grid theorem for vertex-minors
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The structure of the models of decidable monadic theories of graphs
- Twin-width II: small classes
- Twin-width and generalized coloring numbers
- Twin-width. I: Tractable FO model checking
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
Cited in
(12)- Sparse graphs of twin-width 2 have bounded tree-width
- On first-order transductions of classes of graphs
- Monadic NIP in monotone classes of relational structures (extended abstract)
- Twin-width of graphs on surfaces
- Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
- Improved bounds for twin-width parameter variants with algorithmic applications to counting graph colorings
- Randomized communication and implicit graph representations
- Isomorphism for tournaments of small twin width
- Advances in algorithmic meta theorems (invited paper)
- A survey of degree-boundedness
- Elementary first-order model checking for sparse graphs
- Twin-width of subdivisions of multigraphs
This page was built for publication: Stable graphs of bounded twin-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649471)
