Add to ORKGThe authors showed in an earlier paper that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid. The purpose of this paper is to show that if certain natural conditions are imposed on the tree, then it has a uniqueness property. In particular, suppose that, from every pair of edges that meet at a degree-2 vertex and have their other ends of degree at least three, one edge is contracted. Then the resulting tree is unique. © 2006 Elsevier Ltd. All rights reserved
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of ...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
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...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
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...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
Let be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
A 3-connected matroid M is sequential or has path width 3 if its ground set E (M) has a sequential o...
For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays all of i...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
Let M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
AbstractA 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a seque...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of ...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...
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...
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equi...
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...
AbstractLet M be a matroid. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition ...
Let be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
A 3-connected matroid M is sequential or has path width 3 if its ground set E (M) has a sequential o...
For a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays all of i...
AbstractFor a 2-connected matroid M, Cunningham and Edmonds gave a tree decomposition that displays ...
Let M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we p...
AbstractA 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a seque...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of ...
Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we prove that M has an...