May 27, 1992 · In this paper, a set of necessary and sufficient conditions for a matroid to be the bias matroid of a given biased graph is obtained. These ...

The purpose of this paper is to establish a set of necessary and sufficient conditions for a matroid to be the bias matroid of a given biased graph. A.

Characterizing bias matroids. Author: John G. del Greco. John G. del Greco ... Characterizing bias matroids. Mathematics of computing · Discrete mathematics.

In this paper, a set of necessary and sufficient conditions for a matroid to be the bias matroid of a given biased graph is obtained. These conditions are ...

... characterization by forbidden minors (non-bias matroids the proper minors of which are bias matroids), since any minor of a bias matroid is a bias matroid.

of characterizing intrinsically the matroids that are bias, or (complete) lift, matroids of biased graphs and of finding all the biased graphs having a.

The first theorem characterizes the bias matroid G(Q). Recall that a bias circuit is (the edge set of) a balanced circle, or the union of two unbalanced figures ...

Aug 26, 2013 · In this post I will define some matroids on graphs and give some examples. Such examples include graphic matroids, bicircular matroids and Dowling geometries.

Abstract. A connected matroid M is unbreakable if, for each of its flats F, the matroid M/F is connected or, equivalently, if M* has no two skew circuits.

Sep 19, 2016 · Abstract page for arXiv paper 1609.05574: Matrix representations of frame and lifted-graphic matroids correspond to gain functions.