AbstractIn an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid M. The purpose of this paper is to give a polynomial-time algorithm for constructing such a tree for M
AbstractIn this paper, we prove that via an operation “reducing”, every 3-connected representable ma...
Let be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
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...
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...
AbstractTutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M s...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
For a k-connected matroid M, Clark and Whittle showed there is a tree that displays, up to a natural...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
Special Issue Dedicated to Professor W.T. TutteTutte defined a k-separation of a matroid M to be a ...
For a k-connected matroid M, Clark and Whittle showed there is a tree that displays, up to a natura...
Abstract. For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that display...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractIn this paper, we prove that via an operation “reducing”, every 3-connected representable ma...
Let be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
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...
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...
AbstractTutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M s...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
For a k-connected matroid M, Clark and Whittle showed there is a tree that displays, up to a natural...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
Special Issue Dedicated to Professor W.T. TutteTutte defined a k-separation of a matroid M to be a ...
For a k-connected matroid M, Clark and Whittle showed there is a tree that displays, up to a natura...
Abstract. For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that display...
Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in...
AbstractIn this paper, we prove that via an operation “reducing”, every 3-connected representable ma...
Let be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
DOI
Add to ORKG