Towards tight(er) bounds for the excluded grid theorem (Q2221926): Difference between revisions

@@ Property / arXiv ID @@
+.07944
@@ Property / arXiv ID: 1901.07944 / rank @@
+Normal rank
@@ Property / cites work @@
+Degree-3 Treewidth Sparsifiers
@@ Property / cites work: Degree-3 Treewidth Sparsifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Bounds for the Grid-Minor Theorem
@@ Property / cites work: Polynomial Bounds for the Grid-Minor Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests
+Normal rank
@@ Property / cites work @@
+Excluded Grid Theorem
@@ Property / cites work: Excluded Grid Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly deciding minor-closed parameters in general graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
+Normal rank
@@ Property / cites work @@
+Strengthening Erdös-Pósa property for minor-closed graph classes
+Normal rank
@@ Property / cites work @@
+Q4386304
@@ Property / cites work: Q4386304 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost polynomial hardness of node-disjoint paths in grids
+Normal rank
@@ Property / cites work @@
+Q2904769
@@ Property / cites work: Q2904769 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph partitioning using single commodity flows
@@ Property / cites work: Graph partitioning using single commodity flows / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-width and planar minors
@@ Property / cites work: Tree-width and planar minors / rank @@
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Q3549733
@@ Property / cites work: Q3549733 / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
+Normal rank
@@ Property / cites work @@
+On the presence of disjoint subgraphs of a specified type
+Normal rank