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
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of ...
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, ...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, ...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
AbstractTutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M s...
Tutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M such that...
For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays all of i...
AbstractLet M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that ...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
Let be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of ...
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, ...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, ...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
AbstractTutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M s...
Tutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M such that...
For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays all of i...
AbstractLet M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that ...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
Let be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of ...