Add to ORKGSeveral matroids can be defined on the edge set of a graph. Al-though historically the cycle matroid has been the most studied, in recent times, the bicircular matroid has cropped up in several places. A theorem of Matthews from late 1970s gives a characterization of graphs whose bicircular matroids are graphic. We give a characterization of graphs whose bicircular matroids are signed-graphic
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff...
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogou...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with g...
AbstractGiven a graph G, one can define a matroid M=(E,C) on the edges E of G with circuits C where ...
A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, i...
AbstractA bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs c...
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decompositio...
AbstractWe give a decomposition theorem for signed graphs whose frame matroids are binary and a deco...
AbstractWe prove that a connected cographic matroid of a graph G is the bias matroid of a signed gra...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
AbstractA base of the cycle space of a binary matroid M on E is said to be convex if its elements ca...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff...
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogou...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with g...
AbstractGiven a graph G, one can define a matroid M=(E,C) on the edges E of G with circuits C where ...
A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, i...
AbstractA bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs c...
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decompositio...
AbstractWe give a decomposition theorem for signed graphs whose frame matroids are binary and a deco...
AbstractWe prove that a connected cographic matroid of a graph G is the bias matroid of a signed gra...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
AbstractA base of the cycle space of a binary matroid M on E is said to be convex if its elements ca...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff...
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogou...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...