Pages that link to "Item:Q2642007"

The following pages link to The branchwidth of graphs and their cycle matroids (Q2642007):

Displaying 24 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)
• Branchings in rooted graphs and the diameter of greedoids (Q1118604) (← links)
• The extremal functions of classes of matroids of bounded branch-width (Q1748000) (← 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)
• Outerplanar obstructions for matroid pathwidth (Q2857402) (← links)
• Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs (Q2935362) (← links)
• The Branch-Width of Circular-Arc Graphs (Q3525805) (← links)
• Excluding a bipartite circle graph from line graphs (Q3608319) (← links)
• Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
• (Q5005108) (← 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)
• Vertex-minors of graphs: a survey (Q6495258) (← links)