194 search results - page 1 / 39 » Connectivity in frame matroids |
DM
2008
13 years 4 months ago
2008
We discuss the relationship between the vertical connectivity of a biased graph and the Tutte connectivity of the frame matroid of (also known as the bias matroid of ).
DM
2007
13 years 4 months ago
2007
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.
DM
2008
13 years 4 months ago
2008
We characterize all of the ways to represent the wheel matroids and whirl matroids using frame matroids of signed graphs. The characterization of wheels is in terms of topological...
EJC
2008
13 years 3 months ago
2008
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . ...
DM
2010
13 years 5 months ago
2010
We characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e0, . . . , en-1) in such a way that {ei, . . . , ei+t} is 4...