Graphs of bounded depth‐2 rank‐brittleness (Q6055398): Difference between revisions

@@ Property / cites work @@
+Linear rank-width and linear clique-width of trees
+Normal rank
@@ Property / cites work @@
+Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
+Normal rank
@@ Property / cites work @@
+Improved bounds for the sunflower lemma
@@ Property / cites work: Improved bounds for the sunflower lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Rankings of Graphs
@@ Property / cites work: Rankings of Graphs / 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 @@
+Q4942652
@@ Property / cites work: Q4942652 / 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 @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Unavoidable minors of large 3-connected binary matroids
+Normal rank
@@ Property / cites work @@
+Intersection Theorems for Systems of Sets
@@ Property / cites work: Intersection Theorems for Systems of Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
+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 @@
+Q3997075
@@ Property / cites work: Q3997075 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth and vertex-minors
@@ Property / cites work: Tree-depth and vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Excluded vertex-minors for graphs of linear rank-width at most \(k\)
+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 @@
+Obstructions for bounded shrub-depth and rank-depth
+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 @@
+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 @@
+Rank-width and vertex-minors
@@ Property / cites work: Rank-width and vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width: algorithmic and structural results
@@ Property / cites work: Rank-width: algorithmic and structural results / 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 @@
+Optimal node ranking of tree in linear time
@@ Property / cites work: Optimal node ranking of tree in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004146
@@ Property / cites work: Q4004146 / rank @@
+Normal rank