Matroid tree-width
From MaRDI portal
Publication:852702
DOI10.1016/j.ejc.2006.06.005zbMath1103.05019OpenAlexW4210930323MaRDI QIDQ852702
Petr Hliněný, Geoffrey P. Whittle
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
Related Items (13)
A Basic Parameterized Complexity Primer ⋮ On zeros of the characteristic polynomial of matroids of bounded tree-width ⋮ Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) ⋮ Decomposition width of matroids ⋮ Supersolvable saturated matroids and chordal graphs ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ A unified treatment of linked and lean tree-decompositions ⋮ Partitions versus sets: a case of duality ⋮ Linked tree-decompositions of represented infinite matroids ⋮ Classical spin systems and the quantum stabilizer formalism: General mappings and applications ⋮ Addendum to matroid tree-width ⋮ Submodular partition functions
Cites Work
- Trees, grids, and MSO decidability: from graphs to matroids
- Graph minors. X: Obstructions to tree-decomposition
- 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
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Obstructions to branch-decomposition of matroids
- A Parametrized Algorithm for Matroid Branch-Width
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Matroid tree-width