Pages that link to "Item:Q2490835"

The following pages link to Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835):

Displaying 21 items.

• First order convergence of matroids (Q326662) (← links)
• Decomposition width of matroids (Q415290) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
• Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
• Matroid tree-width (Q852702) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
• Tree automata and pigeonhole classes of matroids. I (Q2149094) (← 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)
• Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
• Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
• A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
• Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
• Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
• Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
• Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
• Fast FPT-approximation of branchwidth (Q6593764) (← links)
• Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (Q6634533) (← links)