The branchwidth of graphs and their cycle matroids
From MaRDI portal
Publication:2642007
Recommendations
Cites work
Cited in
(25)- Tangle bases: Revisited
- Rank-width: algorithmic and structural results
- Branch decomposition heuristics for linear matroids
- Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs
- Outerplanar obstructions for matroid pathwidth
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Kernelization using structural parameters on sparse graph classes
- Obstructions for bounded branch-depth in matroids
- Vertex-minors of graphs: a survey
- Monadic second-order model-checking on decomposable matroids
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- On self-duality of branchwidth in graphs of bounded genus
- Minors in graphs of large \(\theta_r\)-girth
- The extremal functions of classes of matroids of bounded branch-width
- Iterative refinement for linear programming
- Connectivity functions and polymatroids
- The Branch-Width of Circular-Arc Graphs
- Finding branch-decompositions of matroids, hypergraphs, and more
- Bounding branch-width
- Excluding a bipartite circle graph from line graphs
- Branchwidth is \((1, g)\)-self-dual
- Branch-depth: generalizing tree-depth of graphs
- Outerplanar obstructions for matroid pathwidth
- Branchings in rooted graphs and the diameter of greedoids
- Branchwidth of graphic matroids
This page was built for publication: The branchwidth of graphs and their cycle matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642007)