An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
From MaRDI portal
Publication:2343464
DOI10.1007/s00026-015-0258-9zbMath1310.05041OpenAlexW2169035983MaRDI QIDQ2343464
Publication date: 5 May 2015
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-015-0258-9
Cites Work
- Unnamed Item
- Unnamed Item
- An upgraded Wheels-and-Whirls theorem for 3-connected matroids
- The structure of the 4-separations in 4-connected matroids
- The structure of the 3-separations of 3-connected matroids
- Tangles, trees, and flowers
- The structure of crossing separations in matroids
- Constructing a 3-tree for a 3-connected matroid
This page was built for publication: An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid