Pages that link to "Item:Q1850591"

The following pages link to Branch-width and well-quasi-ordering in matroids and graphs. (Q1850591):

Displaying 47 items.

• Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
• Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
• Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
• Decomposition width of matroids (Q415290) (← links)
• Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
• A chain theorem for 4-connected matroids (Q707022) (← links)
• Linked tree-decompositions of represented infinite matroids (Q716055) (← links)
• Boolean-width of graphs (Q719257) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• Matroid tree-width (Q852702) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Some recent progress and applications in graph minor theory (Q878052) (← links)
• Some open problems on excluding a uniform matroid (Q953908) (← links)
• Submodular partition functions (Q1045090) (← links)
• On the excluded minors for the matroids of branch-width \(k\) (Q1400961) (← links)
• Branch-width and Rota's conjecture (Q1403924) (← links)
• Biased graphs IV: Geometrical realizations (Q1417965) (← links)
• Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
• A unified treatment of linked and lean tree-decompositions (Q1745735) (← links)
• The extremal functions of classes of matroids of bounded branch-width (Q1748000) (← links)
• On matroids of branch-width three. (Q1850629) (← links)
• Embedding grids in surfaces (Q1883290) (← links)
• Fork-decompositions of matroids (Q1883405) (← links)
• A Menger-like property of tree-cut width (Q1998754) (← links)
• The contributions of W.T. Tutte to matroid theory (Q2001236) (← links)
• Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids (Q2384806) (← links)
• The rank-width of edge-coloured graphs (Q2392245) (← links)
• Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (Q2427899) (← links)
• Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
• Rank-width and vertex-minors (Q2565688) (← links)
• Recent work in matroid representation theory (Q2575800) (← links)
• The branchwidth of graphs and their cycle matroids (Q2642007) (← links)
• Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• (Q2857402) (← links)
• (Q2857429) (← links)
• Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
• Rank-width and Well-quasi-ordering of Skew-symmetric Matrices (Q3439350) (← links)
• Boolean-Width of Graphs (Q3656851) (← links)
• Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
• A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
• On a Generalization of Spikes (Q4625215) (← links)
• Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
• The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids (Q5208744) (← links)
• Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)