On the excluded minors for the matroids of branch-width \(k\)

From MaRDI portal
Publication:1400961

DOI10.1016/S0095-8956(02)00046-1zbMath1032.05027OpenAlexW2079618965MaRDI QIDQ1400961

A. M. H. Gerards, Neil Robertson, Geoffrey P. Whittle, James F. Geelen

Publication date: 17 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00046-1




Related Items (27)

Trees, grids, and MSO decidability: from graphs to matroidsA tight relation between series-parallel graphs and bipartite distance hereditary graphsGraph Minors and Parameterized Algorithm DesignTree automata and pigeonhole classes of matroids. IExcluding a planar graph from \(\mathrm{GF}(q)\)-representable matroidsMatroid tree-widthKernelization using structural parameters on sparse graph classesThe rank-width of edge-coloured graphsMinors in graphs of large \(\theta_r\)-girthA Simpler Self-reduction Algorithm for Matroid Path-WidthFinding branch-decompositions of matroids, hypergraphs, and moreSome recent progress and applications in graph minor theoryOuterplanar obstructions for matroid pathwidthTangle bases: RevisitedBounding branch-widthObstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)Graph theory. Abstracts from the workshop held January 2--8, 2022Branch decomposition heuristics for linear matroids$\mathbb F$ -Rank-Width of (Edge-Colored) GraphsUnnamed ItemBranch-width, parse trees, and monadic second-order logic for matroids.Obstructions to branch-decomposition of matroidsExcluded vertex-minors for graphs of linear rank-width at most \(k\)Tangles, tree-decompositions and grids in matroidsRank-width and vertex-minorsFinding Branch-Decompositions of Matroids, Hypergraphs, and MoreMatrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming



Cites Work


This page was built for publication: On the excluded minors for the matroids of branch-width \(k\)