Add to ORKGIn 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. © 2012 Elsevier Inc
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
AbstractOxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that di...
For our friend Geoff Whittle with thanks for many years of enjoyable collaboration Abstract. In an e...
AbstractIn an earlier paper with Whittle, we showed that there is a tree that displays, up to a natu...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
Tutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M such that...
AbstractTutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M s...
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 other than a wheel or a whirl. In the next paper in this series, we p...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
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 ...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
AbstractOxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that di...
For our friend Geoff Whittle with thanks for many years of enjoyable collaboration Abstract. In an e...
AbstractIn an earlier paper with Whittle, we showed that there is a tree that displays, up to a natu...
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalen...
Let M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M tha...
Tutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M such that...
AbstractTutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M s...
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 other than a wheel or a whirl. In the next paper in this series, we p...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
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 ...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
AbstractOxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that di...