Branch-width and well-quasi-ordering in matroids and graphs.
From MaRDI portal
(Redirected from Publication:1850591)
Recommendations
Cites work
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- A Menger-like property of tree-width: The finite case
- A simpler proof of the excluded minor theorem for higher surfaces
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. X: Obstructions to tree-decomposition
- Highly connected sets and the excluded grid theorem
- Menger's theorem for matroids
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(53)- Outerplanar obstructions for matroid pathwidth
- Trees, grids, and MSO decidability: from graphs to matroids
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Graph classes with structured neighborhoods and algorithmic applications
- Branchwidth is \((1, g)\)-self-dual
- Cutwidth: obstructions and algorithmic aspects
- 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\)
- Decomposition width of matroids
- The contributions of W.T. Tutte to matroid theory
- A chain theorem for 4-connected matroids
- The branchwidth of graphs and their cycle matroids
- Boolean-width of graphs
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- A unified treatment of linked and lean tree-decompositions
- Some open problems on excluding a uniform matroid
- Linked tree-decompositions of represented infinite matroids
- The extremal functions of classes of matroids of bounded branch-width
- Obstructions for bounded branch-depth in matroids
- A simpler self-reduction algorithm for matroid path-width
- Branchwidth of graphic 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
- The matroid secretary problem for minor-closed classes and random matroids
- Some recent progress and applications in graph minor theory
- Bounding branch-width
- Recent work in matroid representation theory
- Branch-depth: generalizing tree-depth of graphs
- Biased graphs IV: Geometrical realizations
- 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
- Matroid tree-width
- Covering Vectors by Spaces: Regular Matroids
- Rank-width and vertex-minors
- Lean Tree-Cut Decompositions: Obstructions and Algorithms
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices
- Excluding a line from complex-representable matroids
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (extended abstract)
- The rank-width of edge-coloured graphs
- On the excluded minors for the matroids of branch-width \(k\)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- Obstructions to branch-decomposition of matroids
- On a generalization of spikes
- 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)
