AbstractGiven 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 Ω
AbstractWe develop linear representation theory for bicircular matroids, a chief example being a mat...
We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte conn...
Report on joint work in progress with Dillon Mayhew, Victoria University of Wellington, New Zealand ...
Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which...
AbstractGiven a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one ...
AbstractA biased graph Ω consists of a graph Γ and a class B of circles (simple, closed paths) in Γ,...
AbstractA biased graph Φ consists of a graph and a class of distinguished polygons such that no thet...
AbstractA biased graph is a graph together with a class of cirles (simple closed paths), called bala...
A gain graph \Phi consists of a graph \Gamma and a gain function from E (\Gamma) to a group G , the ...
AbstractA biased graph Ω consists of a graph Γ and a class of circles in Γ (edge sets of simple, clo...
AbstractWe discuss the relationship between the vertical connectivity of a biased graph Ω and the Tu...
AbstractA frame matroid is any submatroid of a matroid in which each point belongs to a line spanned...
AbstractA gain graph is a graph whose oriented edges are labelled invertibly from a group G, the gai...
Abstractdel Greco, J.G., Characterizing bias matroids, Discrete Mathematics 103 (1992) 153–159. In t...
A biased graph is a graph in which every cycle has been given a bias, either balanced or unbalanced....
AbstractWe develop linear representation theory for bicircular matroids, a chief example being a mat...
We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte conn...
Report on joint work in progress with Dillon Mayhew, Victoria University of Wellington, New Zealand ...
Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which...
AbstractGiven a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one ...
AbstractA biased graph Ω consists of a graph Γ and a class B of circles (simple, closed paths) in Γ,...
AbstractA biased graph Φ consists of a graph and a class of distinguished polygons such that no thet...
AbstractA biased graph is a graph together with a class of cirles (simple closed paths), called bala...
A gain graph \Phi consists of a graph \Gamma and a gain function from E (\Gamma) to a group G , the ...
AbstractA biased graph Ω consists of a graph Γ and a class of circles in Γ (edge sets of simple, clo...
AbstractWe discuss the relationship between the vertical connectivity of a biased graph Ω and the Tu...
AbstractA frame matroid is any submatroid of a matroid in which each point belongs to a line spanned...
AbstractA gain graph is a graph whose oriented edges are labelled invertibly from a group G, the gai...
Abstractdel Greco, J.G., Characterizing bias matroids, Discrete Mathematics 103 (1992) 153–159. In t...
A biased graph is a graph in which every cycle has been given a bias, either balanced or unbalanced....
AbstractWe develop linear representation theory for bicircular matroids, a chief example being a mat...
We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte conn...
Report on joint work in progress with Dillon Mayhew, Victoria University of Wellington, New Zealand ...
DOI
Add to ORKG