Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
From MaRDI portal
Publication:2692778
DOI10.1016/j.jctb.2022.12.004OpenAlexW3201876934MaRDI QIDQ2692778
Sang-il Oum, Eun Jung Kim, Mamadou Moustapha Kanté, O-joung Kwon
Publication date: 23 March 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.12291
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)
Cites Work
- Unnamed Item
- Outerplanar obstructions for matroid pathwidth
- Graph minors. XX: Wagner's conjecture
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Upper bounds on the size of obstructions and intertwines
- On the excluded minors for the matroids of branch-width \(k\)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Branch-width and well-quasi-ordering in matroids and graphs.
- Obstructions for linear rank-width at most 1
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- Graph minors. IV: Tree-width and well-quasi-ordering
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Excluded vertex-minors for graphs of linear rank-width at most k.
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
- Constructive algorithm for path-width of matroids
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Linear Layouts in Submodular Systems
- The Tutte Polynomial for Matroids of Bounded Branch-Width
- Menger's theorem for matroids
This page was built for publication: Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
