scientific article; zbMATH DE number 952954
From MaRDI portal
Publication:4717852
Recommendations
Cited in
(16)- Obstructions to branch-decomposition of matroids
- Tangle bases: Revisited
- The branchwidth of graphs and their cycle matroids
- Obstructions for bounded branch-depth in matroids
- Tangle and Maximal Ideal
- scientific article; zbMATH DE number 4145914 (Why is no real title available?)
- Tangles, tree-decompositions and grids in matroids
- Matroid 3-connectivity and branch width
- A min-max theorem for plane bipartite graphs
- A decomposition of the matroids with the max-flow min-cut property
- Matroids denser than a clique
- Approximating clique-width and branch-width
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
- Matroids representable over fields with a common subfield
- Excluding a line from complex-representable matroids
- Fork-decompositions of matroids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717852)