AbstractWe discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte connectivity of the frame matroid of Ω (also known as the bias matroid of Ω)
A gain graph \Phi consists of a graph \Gamma and a gain function from E (\Gamma) to a group G , the ...
A biased graph is a graph in which every cycle has been given a bias, either balanced or unbalanced....
AbstractA biased graph Φ consists of a graph and a class of distinguished polygons such that no thet...
We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte conn...
AbstractWe discuss the relationship between the vertical connectivity of a biased graph Ω and the Tu...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractA frame matroid is any submatroid of a matroid in which each point belongs to a line spanned...
A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, O...
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 Γ,...
Report on joint work in progress with Dillon Mayhew, Victoria University of Wellington, New Zealand ...
A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, i...
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one eas...
Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which...
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 ...
A biased graph is a graph in which every cycle has been given a bias, either balanced or unbalanced....
AbstractA biased graph Φ consists of a graph and a class of distinguished polygons such that no thet...
We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte conn...
AbstractWe discuss the relationship between the vertical connectivity of a biased graph Ω and the Tu...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractA frame matroid is any submatroid of a matroid in which each point belongs to a line spanned...
A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, O...
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 Γ,...
Report on joint work in progress with Dillon Mayhew, Victoria University of Wellington, New Zealand ...
A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, i...
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one eas...
Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which...
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 ...
A biased graph is a graph in which every cycle has been given a bias, either balanced or unbalanced....
AbstractA biased graph Φ consists of a graph and a class of distinguished polygons such that no thet...
DOI
Add to ORKG