Constructing a 3-tree for a 3-connected matroid
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid M. The purpose of this paper is to give a polynomial-time algorithm for constructing such a tree for M. © 2012 Elsevier Inc.
Publication Source (Journal or Book title)
Advances in Applied Mathematics
Oxley, J., & Semple, C. (2013). Constructing a 3-tree for a 3-connected matroid. Advances in Applied Mathematics, 50 (1), 176-200. https://doi.org/10.1016/j.aam.2011.09.007