3 search results - page 1 / 1 » The structure of the 3-separations of 3-connected matroids I... |
EJC
2007
13 years 4 months ago
2007
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 ...
JCT
2008
13 years 3 months ago
2008
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connec...
EJC
2007
13 years 4 months ago
2007
A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek...