Pages that link to "Item:Q1400961"

The following pages link to On the excluded minors for the matroids of branch-width \(k\) (Q1400961):

Displaying 32 items.

• Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
• Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
• On the excluded minors for matroids of branch-width three (Q698604) (← links)
• Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• Matroid tree-width (Q852702) (← links)
• Some recent progress and applications in graph minor theory (Q878052) (← links)
• Addendum to matroid tree-width (Q1024300) (← links)
• Tangles, tree-decompositions and grids in matroids (Q1026005) (← links)
• The extremal functions of classes of matroids of bounded branch-width (Q1748000) (← links)
• Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids (Q2384806) (← links)
• The rank-width of edge-coloured graphs (Q2392245) (← links)
• Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
• Branch decomposition heuristics for linear matroids (Q2445840) (← links)
• Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
• Obstructions to branch-decomposition of matroids (Q2496205) (← links)
• Rank-width and vertex-minors (Q2565688) (← links)
• The branchwidth of graphs and their cycle matroids (Q2642007) (← links)
• Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• Outerplanar obstructions for matroid pathwidth (Q2857402) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
• Edge-maximal graphs of branchwidth k (Q3439366) (← links)
• A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
• Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
• Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
• A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
• Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
• Tangle bases: Revisited (Q6087071) (← links)
• Bounding branch-width (Q6133165) (← links)