Branch-width and well-quasi-ordering in matroids and graphs.
From MaRDI portal
Publication:1850591
DOI10.1006/JCTB.2001.2082zbMATH Open1037.05013OpenAlexW2006587062MaRDI QIDQ1850591FDOQ1850591
James F. Geelen, Geoff Whittle, A. M. H. Gerards
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
Recommendations
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- Highly connected sets and the excluded grid theorem
- Menger's theorem for matroids
- Title not available (Why is that?)
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Graph minors. IV: Tree-width and well-quasi-ordering
- A simpler proof of the excluded minor theorem for higher surfaces
- A Menger-like property of tree-width: The finite case
Cited In (50)
- Excluding a line from complex-representable matroids
- Outerplanar obstructions for matroid pathwidth
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Trees, grids, and MSO decidability: from graphs to matroids
- Cutwidth: obstructions and algorithmic aspects
- The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids
- Tree-representation of set families and applications to combinatorial decompositions
- Embedding grids in surfaces
- A Menger-like property of tree-cut width
- Submodular partition functions
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
- The branchwidth of graphs and their cycle matroids
- The contributions of W.T. Tutte to matroid theory
- Decomposition width of matroids
- A chain theorem for 4-connected matroids
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- 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
- Linked tree-decompositions of represented infinite matroids
- Fork-decompositions of matroids
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Branch-width and Rota's conjecture
- Graph classes with structured neighborhoods and algorithmic applications
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
- Boolean-width of graphs
- On a Generalization of Spikes
- Bounding branch-width
- Some recent progress and applications in graph minor theory
- Recent work in matroid representation theory
- Branch-depth: generalizing tree-depth of graphs
- Biased graphs IV: Geometrical realizations
- Graph Classes with Structured Neighborhoods and Algorithmic Applications
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Twin-width IV: ordered graphs and matrices
- On matroids of branch-width three.
- Outerplanar obstructions for matroid pathwidth
- Covering Vectors by Spaces: Regular Matroids
- Matroid tree-width
- Rank-width and vertex-minors
- Lean Tree-Cut Decompositions: Obstructions and Algorithms
- A Simpler Self-reduction Algorithm for Matroid Path-Width
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices
- Boolean-Width of Graphs
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (extended abstract)
- The rank-width of edge-coloured graphs
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- On the excluded minors for the matroids of branch-width \(k\)
- Branchwidth is \((1, g)\)-self-dual
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
This page was built for publication: Branch-width and well-quasi-ordering in matroids and graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850591)
