AbstractIn this paper, we prove that via an operation “reducing”, every 3-connected representable matroid M with at least nine elements can be decomposed into a set of sequentially 4-connected matroids and three special matroids which we call freely-placed-line matroids, spike-like matroids and swirl-like matroids; more concretely, there is a labeled tree that gives a precise description of the way that M built from its pieces
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
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, ...
Abstract. For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that display...
AbstractIn an earlier paper with Whittle, we showed that there is a tree that displays, up to a natu...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
For our friend Geoff Whittle with thanks for many years of enjoyable collaboration Abstract. In an e...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequentia...
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...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
This dissertation consists of several results on matroid and graph structure and is organized into t...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
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, ...
Abstract. For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that display...
AbstractIn an earlier paper with Whittle, we showed that there is a tree that displays, up to a natu...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
For our friend Geoff Whittle with thanks for many years of enjoyable collaboration Abstract. In an e...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequentia...
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...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
This dissertation consists of several results on matroid and graph structure and is organized into t...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractOxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that di...
DOI
Add to ORKG