Pages that link to "Item:Q2642007"
From MaRDI portal
The following pages link to The branchwidth of graphs and their cycle matroids (Q2642007):
Displayed 17 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Connectivity functions and polymatroids (Q730631) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Iterative Refinement for Linear Programming (Q2830949) (← links)
- (Q2857402) (← links)
- Excluding a bipartite circle graph from line graphs (Q3608319) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- Obstructions for Bounded Branch-depth in Matroids (Q5162868) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
- Bounding branch-width (Q6133165) (← links)