A Menger-like property of tree-width: The finite case
From MaRDI portal
Publication:1097894
DOI10.1016/0095-8956(90)90130-RzbMath0636.05022OpenAlexW2060785476MaRDI QIDQ1097894
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(90)90130-r
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (26)
Embedding grids in surfaces ⋮ A Menger-like property of tree-width: The finite case ⋮ Graph minors. IV: Tree-width and well-quasi-ordering ⋮ On objects dual to tree-cut decompositions ⋮ Characterising \(k\)-connected sets in infinite graphs ⋮ The Menger-like property of the three-width of infinite graphs ⋮ Sparse obstructions for minor-covering parameters ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ The edge-density for \(K_{2,t}\) minors ⋮ \(K_{6}\) minors in 6-connected graphs of bounded tree-width ⋮ Branch-width and Rota's conjecture ⋮ Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices ⋮ On the Block Number of Graphs ⋮ Cutwidth: obstructions and algorithmic aspects ⋮ The size of an intertwine ⋮ Minimum Bisection Is Fixed-Parameter Tractable ⋮ A unified treatment of linked and lean tree-decompositions ⋮ A Menger-like property of tree-cut width ⋮ A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors ⋮ Connected tree-width ⋮ Directed Path-Decompositions ⋮ Upper bounds on the size of obstructions and intertwines ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms ⋮ Graph minors. XXI. graphs with unique linkages ⋮ Branch-width and well-quasi-ordering in matroids and graphs. ⋮ Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
Cites Work
This page was built for publication: A Menger-like property of tree-width: The finite case
