The structure of the 3-separations of 3-connected matroids II

Simple item page
dc.contributor.authorOxley, J.
dc.contributor.authorSemple, C.
dc.contributor.authorWhittle, G.
dc.date.accessioned2008-10-16T23:21:09Z
dc.date.available2008-10-16T23:21:09Z
dc.date.issued2007en
dc.description.abstractThe 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.en
dc.identifier.citationOxley, J., Semple, C., Whittle, G. (2007) The structure of the 3-separations of 3-connected matroids II. European Journal of Combinatorics, 28(4), pp. 1239-1261.en
dc.identifier.doihttps://doi.org/10.1016/j.ejc.2006.01.007
dc.identifier.urihttp://hdl.handle.net/10092/1704
dc.language.isoen
dc.publisherUniversity of Canterbury. Mathematics and Statistics.en
dc.rights.urihttps://hdl.handle.net/10092/17651en
dc.subject.marsdenFields of Research::230000 Mathematical Sciences::230100 Mathematics::230103 Rings and algebrasen
dc.subject.marsdenFields of Research::230000 Mathematical Sciences::230100 Mathematics::230101 Mathematical logic, set theory, lattices and combinatoricsen
dc.titleThe structure of the 3-separations of 3-connected matroids IIen
dc.typeJournal Article
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
12606882_OSW06a.pdf
Size:
262.53 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Journal Articles