194 search results - page 3 / 39 » Connectivity in frame matroids |
CPC
2000
13 years 6 months ago
2000
We examine the specialization to simple matroids of certain problems in extremal matroid theory that are concerned with bounded cocircuit size. Assume that each cocircuit of a simp...
EJC
2011
13 years 1 months ago
2011
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algor...
DM
2006
13 years 6 months ago
2006
Given a 3-connected biased graph with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of is uniquely represented by .
JCT
2010
13 years 4 months ago
2010
We prove that every 3-connected GF(q)-representable matroid that contains the projective plane, PG(2, q), as a minor is uniquely representable.
JGT
2010
13 years 4 months ago
2010
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...