Addendum to matroid tree-width

DOI10.1016/J.EJC.2008.09.028MaRDI QIDQ1024300zbMATH OpenOpenAlexFDO

Authors Petr Hliněný, Geoff Whittle

Publication date 17 June 2009

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2008.09.028

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Matroid tree-width
• On the interplay between graphs and matroids
• On the excluded minors for the matroids of branch-width \(k\)
• Branchwidth of graphic matroids
• Decomposition width of matroids

Cites work

• Graph minors. X: Obstructions to tree-decomposition
• Matroid tree-width

Cited in

(6)

• A unified treatment of linked and lean tree-decompositions
• Unifying duality theorems for width parameters in graphs and matroids (extended abstract)
• Decomposition width of matroids
• Linked tree-decompositions of represented infinite matroids
• Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
• Matroid tree-width

Describes a project that uses

Uses Software

• Isolde

This page was built for publication: Addendum to matroid tree-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024300)