Matroid tree-width
From MaRDI portal
Publication:852702
DOI10.1016/J.EJC.2006.06.005zbMATH Open1103.05019OpenAlexW4210930323MaRDI QIDQ852702FDOQ852702
Publication date: 15 November 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.06.005
Recommendations
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Title not available (Why is that?)
- A Parametrized Algorithm for Matroid Branch-Width
- On the excluded minors for the matroids of branch-width \(k\)
- Branch-width and well-quasi-ordering in matroids and graphs.
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Obstructions to branch-decomposition of matroids
- Trees, grids, and MSO decidability: from graphs to matroids
Cited In (16)
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)
- Supersolvable saturated matroids and chordal graphs
- Partitions versus sets: a case of duality
- Submodular partition functions
- The branchwidth of graphs and their cycle matroids
- Decomposition width of matroids
- A unified treatment of linked and lean tree-decompositions
- Linked tree-decompositions of represented infinite matroids
- Branchwidth of graphic matroids
- Addendum to matroid tree-width
- Classical spin systems and the quantum stabilizer formalism: General mappings and applications
- A Basic Parameterized Complexity Primer
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- Branch-depth: generalizing tree-depth of graphs
- On zeros of the characteristic polynomial of matroids of bounded tree-width
- Domino Treewidth
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)
