We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same even cuts. These results are proved in the more general context of signed binary matroids
The fundamental concepts of graph theory are cycles, Eulerian graphs, bonds, cuts, spanning trees an...
AbstractWe continue the study initiated in “Signed graph coloring” of the chromatic and Whitney poly...
AbstractWe prove that a connected cographic matroid of a graph G is the bias matroid of a signed gra...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogou...
A signed graph is a representation of an even cycle matroid M if the cycles of M correspond to the e...
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...
In this thesis we consider two classes of binary matroids, even cycle matroids and even cut matroids...
A signed graph is a pair (G,⌃) where G is a graph and ⌃ is a subset of the edges of G. A circuit of ...
Several matroids can be defined on the edge set of a graph. Al-though historically the cycle matroid...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with g...
In this thesis, two classes of binary matroids will be discussed: even-cycle and even-cut matroids, ...
The fundamental concepts of graph theory are cycles, Eulerian graphs, bonds, cuts, spanning trees an...
AbstractWe continue the study initiated in “Signed graph coloring” of the chromatic and Whitney poly...
AbstractWe prove that a connected cographic matroid of a graph G is the bias matroid of a signed gra...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogou...
A signed graph is a representation of an even cycle matroid M if the cycles of M correspond to the e...
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...
In this thesis we consider two classes of binary matroids, even cycle matroids and even cut matroids...
A signed graph is a pair (G,⌃) where G is a graph and ⌃ is a subset of the edges of G. A circuit of ...
Several matroids can be defined on the edge set of a graph. Al-though historically the cycle matroid...
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matr...
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with g...
In this thesis, two classes of binary matroids will be discussed: even-cycle and even-cut matroids, ...
The fundamental concepts of graph theory are cycles, Eulerian graphs, bonds, cuts, spanning trees an...
AbstractWe continue the study initiated in “Signed graph coloring” of the chromatic and Whitney poly...
AbstractWe prove that a connected cographic matroid of a graph G is the bias matroid of a signed gra...
DOI
Add to ORKG