AbstractA 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1,e2,…,en) such that ({e1,e2,…,ek},{ek+1,ek+2,…,en}) is a 3-separation for all k in {3,4,…,n−3}. In this paper, we consider the possible sequential orderings that such a matroid can have. In particular, we prove that M essentially has two fixed ends, each of which is a maximal segment, a maximal cosegment, or a maximal fan. We also identify the possible structures in M that account for different sequential orderings of E(M). These results rely on an earlier paper of the authors that describes the structure of equivalent non-sequential 3-separations in a 3-connected matroid. Those results are extended her...
AbstractA 3-separation (A, B), in a matroid M, is called sequential if the elements of A can be orde...
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...
A 3-connected matroid M is sequential or has path width 3 if its ground set E (M) has a sequential o...
AbstractA 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a seque...
A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential or...
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequentia...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequentia...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
AbstractLet M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that ...
AbstractTutte's Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a whe...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
AbstractA 3-separation (A, B), in a matroid M, is called sequential if the elements of A can be orde...
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...
A 3-connected matroid M is sequential or has path width 3 if its ground set E (M) has a sequential o...
AbstractA 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a seque...
A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential or...
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequentia...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequentia...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
AbstractLet M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that ...
AbstractTutte's Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a whe...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
AbstractA 3-separation (A, B), in a matroid M, is called sequential if the elements of A can be orde...
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...