Branch-width and well-quasi-ordering in matroids and graphs.
From MaRDI portal
Publication:1850591
DOI10.1006/jctb.2001.2082zbMath1037.05013OpenAlexW2006587062MaRDI QIDQ1850591
A. M. H. Gerards, James F. Geelen, Geoffrey P. Whittle
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1100
Related Items (48)
Trees, grids, and MSO decidability: from graphs to matroids ⋮ Embedding grids in surfaces ⋮ Fork-decompositions of matroids ⋮ Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids ⋮ Matroid tree-width ⋮ The branchwidth of graphs and their cycle matroids ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ Vertex-minors, monadic second-order logic, and a conjecture by Seese ⋮ The rank-width of edge-coloured graphs ⋮ A Simpler Self-reduction Algorithm for Matroid Path-Width ⋮ Some recent progress and applications in graph minor theory ⋮ Graph classes with structured neighborhoods and algorithmic applications ⋮ Outerplanar obstructions for matroid pathwidth ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ On the excluded minors for the matroids of branch-width \(k\) ⋮ Branchwidth is \((1, g)\)-self-dual ⋮ Bounding branch-width ⋮ Decomposition width of matroids ⋮ Branch-width and Rota's conjecture ⋮ Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices ⋮ Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Biased graphs IV: Geometrical realizations ⋮ Well-quasi-ordering of matrices under Schur complement and applications to directed graphs ⋮ On a Generalization of Spikes ⋮ Cutwidth: obstructions and algorithmic aspects ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ A unified treatment of linked and lean tree-decompositions ⋮ The extremal functions of classes of matroids of bounded branch-width ⋮ Some open problems on excluding a uniform matroid ⋮ A Menger-like property of tree-cut width ⋮ Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm ⋮ The contributions of W.T. Tutte to matroid theory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Branch-width, parse trees, and monadic second-order logic for matroids. ⋮ A chain theorem for 4-connected matroids ⋮ Linked tree-decompositions of represented infinite matroids ⋮ Boolean-width of graphs ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms ⋮ Graph Classes with Structured Neighborhoods and Algorithmic Applications ⋮ Boolean-Width of Graphs ⋮ Rank-width and vertex-minors ⋮ Submodular partition functions ⋮ Recent work in matroid representation theory ⋮ On matroids of branch-width three. ⋮ Rank-width and Well-quasi-ordering of Skew-symmetric Matrices
Cites Work
- Unnamed Item
- A Menger-like property of tree-width: The finite case
- Graph minors. X: Obstructions to tree-decomposition
- Highly connected sets and the excluded grid theorem
- A simpler proof of the excluded minor theorem for higher surfaces
- Graph minors. IV: Tree-width and well-quasi-ordering
- Menger's theorem for matroids
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
This page was built for publication: Branch-width and well-quasi-ordering in matroids and graphs.
