Add to ORKGWe 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 frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, i...
AbstractA biased graph Φ consists of a graph and a class of distinguished polygons such that no thet...
A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, O...
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...
AbstractA frame matroid is any submatroid of a matroid in which each point belongs to a line spanned...
Report on joint work in progress with Dillon Mayhew, Victoria University of Wellington, New Zealand ...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractGiven a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one ...
Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which...
We determine the structure of clonal classes of 3-connected frame matroids in terms of the structure...
Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...
A gain graph \Phi consists of a graph \Gamma and a gain function from E (\Gamma) to a group G , the ...
AbstractThe connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E − X) −...
Abstractdel Greco, J.G., Characterizing bias matroids, Discrete Mathematics 103 (1992) 153–159. In t...
A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, i...
AbstractA biased graph Φ consists of a graph and a class of distinguished polygons such that no thet...
A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, O...
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...
AbstractA frame matroid is any submatroid of a matroid in which each point belongs to a line spanned...
Report on joint work in progress with Dillon Mayhew, Victoria University of Wellington, New Zealand ...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractGiven a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one ...
Given a 3-connected biased graph Ω with three node-disjoint unbalanced circles, at most one of which...
We determine the structure of clonal classes of 3-connected frame matroids in terms of the structure...
Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...
A gain graph \Phi consists of a graph \Gamma and a gain function from E (\Gamma) to a group G , the ...
AbstractThe connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E − X) −...
Abstractdel Greco, J.G., Characterizing bias matroids, Discrete Mathematics 103 (1992) 153–159. In t...
A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, i...
AbstractA biased graph Φ consists of a graph and a class of distinguished polygons such that no thet...
A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, O...