Title

Constructing a 3-tree for a 3-connected matroid

Document Type

Article

Publication Date

1-1-2013

Abstract

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

First Page

176

Last Page

200

This document is currently not available here.

Share

COinS