Matroid tree-width

DOI10.1016/J.EJC.2006.06.005MaRDI QIDQ852702zbMATH OpenOpenAlexFDO

Authors Petr Hliněný, Geoff 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

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Addendum to matroid tree-width
• Branchwidth of graphic matroids
• A Parametrized Algorithm for Matroid Branch-Width
• Branch-width, parse trees, and monadic second-order logic for matroids.
• On the excluded minors for the matroids of branch-width \(k\)

Cites work

• 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
• 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?)
• 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

(19)

• Addendum to matroid tree-width
• Submodular partition functions
• A unified treatment of linked and lean tree-decompositions
• Branch-depth: generalizing tree-depth of graphs
• The branchwidth of graphs and their cycle matroids
• A basic parameterized complexity primer
• Unifying duality theorems for width parameters in graphs and matroids (extended abstract)
• Classical spin systems and the quantum stabilizer formalism: general mappings and applications
• On zeros of the characteristic polynomial of matroids of bounded tree-width
• Decomposition width of matroids
• Domino Treewidth
• Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
• scientific article; zbMATH DE number 952954 (Why is no real title available?)
• Branchwidth of graphic matroids
• Supersolvable saturated matroids and chordal graphs
• Linked tree-decompositions of represented infinite matroids
• Monotonicity of the cops and robber game for bounded depth treewidth
• Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
• Partitions versus sets: a case of duality

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)