scientific article; zbMATH DE number 952954

zbMATH Open0954.05014MaRDI QIDQ4717852FDOQ4717852

Authors: Jack S. Dharmatilake 

Publication date: 1 December 1996

Title of this publication is not available (Why is that?)

Recommendations

• On the excluded minors for the matroids of branch-width \(k\)
• Matroid 3-connectivity and branch width
• Applications of matroid partition to tree decomposition
• Matroid tree-width

zbMATH Keywords

min-max theorembranch-width of matroidsmatroid separations

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (16)

• Title not available (Why is that?)
• Tangle and Maximal Ideal
• A min-max theorem for plane bipartite graphs
• A decomposition of the matroids with the max-flow min-cut property
• Tangles, tree-decompositions and grids in matroids
• Matroids representable over fields with a common subfield
• The branchwidth of graphs and their cycle matroids
• Obstructions for bounded branch-depth in matroids
• Fork-decompositions of matroids
• Matroids denser than a clique
• Tangle bases: Revisited
• Approximating clique-width and branch-width
• Excluding a line from complex-representable matroids
• Obstructions to branch-decomposition of matroids
• Matroid 3-connectivity and branch width
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm

This page was built for publication:

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