Document Type

Article

Publication Date

7-1-2008

Abstract

Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, up to a natural equivalence, all non-trivial 3-separations of M. Crossing 3-separations gave rise to fundamental structures known as flowers. In this paper, we define a generalized flower structure called a k-flower, with no assumptions on the connectivity of M. We completely classify k-flowers in terms of the local connectivity between pairs of petals. © 2007 Elsevier Inc. All rights reserved.

Publication Source (Journal or Book title)

Advances in Applied Mathematics

First Page

10

Last Page

26

Share

COinS