Branchwidth of graphic matroids

MaRDI QIDQ5421816zbMATH OpenFDO

Authors Frédéric Mazoit, Stéphan Thomassé

Publication date 24 October 2007

zbMATH Keywords

branchwidthmatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• The branchwidth of graphs and their cycle matroids
• Matroid tree-width
• On the excluded minors for the matroids of branch-width \(k\)
• On the interplay between graphs and matroids
• Branch-width and well-quasi-ordering in matroids and graphs.

Cited in

(20)

• Addendum to matroid tree-width
• Branchings in rooted graphs and the diameter of greedoids
• The extremal functions of classes of matroids of bounded branch-width
• Branch-depth: generalizing tree-depth of graphs
• Rank-width: algorithmic and structural results
• Branch decomposition heuristics for linear matroids
• The branchwidth of graphs and their cycle matroids
• Outerplanar obstructions for matroid pathwidth
• Outerplanar obstructions for matroid pathwidth
• On self-duality of branchwidth in graphs of bounded genus
• Coverability and sub-exponential parameterized algorithms in planar graphs
• Finding branch-decompositions of matroids, hypergraphs, and more
• Obstructions for bounded branch-depth in matroids
• Monadic second-order model-checking on decomposable matroids
• Tangle bases: Revisited
• Branchwidth is \((1, g)\)-self-dual
• Bounding branch-width
• Pathwidth vs Cocircumference
• Closure property of contraction-depth of matroids
• Matroid tree-width

This page was built for publication: Branchwidth of graphic matroids

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