Tangles, trees, and flowers

DOI10.1016/j.jctb.2013.03.002zbMath1301.05261arXiv1109.1048OpenAlexW2040391908MaRDI QIDQ744163

Ben Clark, Geoffrey P. Whittle

Publication date: 6 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.1048

zbMATH Keywords

\(k\)-connected component

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (5)

The structure of 4-flowers of vertically 4-connected matroids ⋮ Tangle and Maximal Ideal ⋮ Connectivity functions and polymatroids ⋮ Tangle and ultrafilter: game theoretical interpretation ⋮ An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid

Cites Work

• Unnamed Item
• Unnamed Item
• The structure of the 4-separations in 4-connected matroids
• The structure of the 3-separations of 3-connected matroids
• The structure of the 3-separations of 3-connected matroids. II.
• The structure of crossing separations in matroids
• Tangles, tree-decompositions and grids in matroids
• Graph minors. X: Obstructions to tree-decomposition
• Obstructions to branch-decomposition of matroids

This page was built for publication: Tangles, trees, and flowers