Constructing a 3-tree for a 3-connected matroid

DOI10.1016/j.aam.2011.09.007zbMath1256.05046OpenAlexW2073933288MaRDI QIDQ1931415

Charles Semple, James G. Oxley

Publication date: 14 January 2013

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2011.09.007

zbMATH Keywords

tree decomposition3-connected matroid3-separation3-tree

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)

Related Items (2)

On the number of bases of almost all matroids ⋮ An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid

This page was built for publication: Constructing a 3-tree for a 3-connected matroid