AbstractOxley, 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
For our friend Geoff Whittle with thanks for many years of enjoyable collaboration Abstract. In an e...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, ...
AbstractOxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that di...
Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, ...
Special Issue Dedicated to Professor W.T. TutteTutte defined a k-separation of a matroid M to be a ...
AbstractTutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M s...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
Abstract. For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that display...
A tangle of order k in a connectivity function λ may be thought of as a "k-connected component" of λ...
For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays all of i...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
AbstractIn an earlier paper with Whittle, we showed that there is a tree that displays, up to a natu...
For our friend Geoff Whittle with thanks for many years of enjoyable collaboration Abstract. In an e...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, ...
AbstractOxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that di...
Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, ...
Special Issue Dedicated to Professor W.T. TutteTutte defined a k-separation of a matroid M to be a ...
AbstractTutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M s...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
Abstract. For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that display...
A tangle of order k in a connectivity function λ may be thought of as a "k-connected component" of λ...
For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays all of i...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
AbstractIn an earlier paper with Whittle, we showed that there is a tree that displays, up to a natu...
For our friend Geoff Whittle with thanks for many years of enjoyable collaboration Abstract. In an e...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...