Linked tree-decompositions of represented infinite matroids
From MaRDI portal
Publication:716055
DOI10.1016/j.jctb.2010.12.003zbMath1298.05052MaRDI QIDQ716055
Publication date: 19 April 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2010.12.003
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05B35: Combinatorial aspects of matroids and geometric lattices
05C83: Graph minors
Related Items
Lean Tree-Cut Decompositions: Obstructions and Algorithms, Linked tree-decompositions of represented infinite matroids, A unified treatment of linked and lean tree-decompositions, A Menger-like property of tree-cut width
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linked tree-decompositions of represented infinite matroids
- Matroid tree-width
- Addendum to matroid tree-width
- The Menger-like property of the three-width of infinite graphs
- Cliques in dense GF(\(q\))-representable matroids
- Branch-width and well-quasi-ordering in matroids and graphs.
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- Varieties of Combinatorial Geometries
- Infinite Matroids