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. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.aam.2007.05.004 | Advances in Applied Mathematics |
Keywords | Field | DocType |
m. crossing 3-separations,fundamental structure,3-connected matroid,generalized flower structure,tree decomposition,natural equivalence,local connectivity | Matroid,Discrete mathematics,Combinatorics,Mathematical analysis,Tree decomposition,Decomposition method (constraint satisfaction),Equivalence (measure theory),Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
41 | 1 | 0196-8858 |
Citations | PageRank | References |
6 | 0.66 | 3 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jeremy Aikin | 1 | 9 | 1.48 |
James Oxley | 2 | 20 | 4.05 |