Back to Search
Start Over
The structure of the 3-separations of 3-connected matroids II
- Source :
-
European Journal of Combinatorics . May2007, Vol. 28 Issue 4, p1239-1261. 23p. - Publication Year :
- 2007
-
Abstract
- Abstract: The 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. [Copyright &y& Elsevier]
- Subjects :
- *GRAPH theory
*MATROIDS
*COMBINATORICS
*ALGEBRA
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 28
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 24298006
- Full Text :
- https://doi.org/10.1016/j.ejc.2006.01.007