Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1136093 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- A Parametrized Algorithm for Matroid Branch-Width
- Branch-width and well-quasi-ordering in matroids and graphs.
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Graph minors. X: Obstructions to tree-decomposition
- Obstructions to branch-decomposition of matroids
- On the excluded minors for the matroids of branch-width \(k\)
- Trees, grids, and MSO decidability: from graphs to matroids
Cited in
(16)- Domino Treewidth
- The branchwidth of graphs and their cycle matroids
- Submodular partition functions
- Decomposition width of matroids
- Supersolvable saturated matroids and chordal graphs
- Addendum to matroid tree-width
- Unifying duality theorems for width parameters in graphs and matroids (extended abstract)
- Classical spin systems and the quantum stabilizer formalism: general mappings and applications
- Linked tree-decompositions of represented infinite matroids
- Partitions versus sets: a case of duality
- A unified treatment of linked and lean tree-decompositions
- A basic parameterized complexity primer
- Branch-depth: generalizing tree-depth of graphs
- On zeros of the characteristic polynomial of matroids of bounded tree-width
- Branchwidth of graphic matroids
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
This page was built for publication: Matroid tree-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852702)
