Obstructions for bounded shrub-depth and rank-depth (Q2033913): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3124632410
@@ Property / OpenAlex ID: W3124632410 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00230
@@ Property / arXiv ID: 1911.00230 / rank @@
+Normal rank
@@ Property / cites work @@
+Obstructions for linear rank-width at most 1
@@ Property / cites work: Obstructions for linear rank-width at most 1 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972128
@@ Property / cites work: Q3972128 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-minors, monadic second-order logic, and a conjecture by Seese
+Normal rank
@@ Property / cites work @@
+Computing small pivot-minors
@@ Property / cites work: Computing small pivot-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-depth: generalizing tree-depth of graphs
@@ Property / cites work: Branch-depth: generalizing tree-depth of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4625695
@@ Property / cites work: Q4625695 / rank @@
+Normal rank
@@ Property / cites work @@
+When Trees Grow Low: Shrubs and Fast MSO1
@@ Property / cites work: When Trees Grow Low: Shrubs and Fast MSO1 / rank @@
+Normal rank
@@ Property / cites work @@
+Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
+Normal rank
@@ Property / cites work @@
+Tree-depth and vertex-minors
@@ Property / cites work: Tree-depth and vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
+Normal rank
@@ Property / cites work @@
+Graphs of small rank-width are pivot-minors of graphs of small tree-width
+Normal rank
@@ Property / cites work @@
+Unavoidable vertex-minors in large prime graphs
@@ Property / cites work: Unavoidable vertex-minors in large prime graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs of bounded depth‐2 rank‐brittleness
@@ Property / cites work: Graphs of bounded depth‐2 rank‐brittleness / rank @@
+Normal rank
@@ Property / cites work @@
+Scattered Classes of Graphs
@@ Property / cites work: Scattered Classes of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Structural sparsity
@@ Property / cites work: Structural sparsity / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
+Normal rank
@@ Property / cites work @@
+On low tree-depth decompositions
@@ Property / cites work: On low tree-depth decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width and vertex-minors
@@ Property / cites work: Rank-width and vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank