Pages that link to "Item:Q2384806"
From MaRDI portal
The following pages link to Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids (Q2384806):
Displaying 22 items.
- Decomposition width of matroids (Q415290) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Exposing 3-separations in 3-connected matroids (Q719331) (← 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)
- Tangles, tree-decompositions and grids in matroids (Q1026005) (← links)
- The extremal functions of classes of matroids of bounded branch-width (Q1748000) (← links)
- The contributions of W.T. Tutte to matroid theory (Q2001236) (← links)
- Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
- The grid theorem for vertex-minors (Q2099410) (← links)
- Matroids denser than a clique (Q2349507) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- On Rota's conjecture and excluded minors containing large projective geometries. (Q2490840) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- The binary matroids with no odd circuits of size exceeding five (Q2664551) (← links)
- Excluding a bipartite circle graph from line graphs (Q3608319) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- Obstructions for Bounded Branch-depth in Matroids (Q5162868) (← links)
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors (Q5883288) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
