Document Type
Article
Publication Date
2006
Abstract
Given 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 Ω.
Repository Citation
Slilaty, D.
(2006). Bias Matroids With Unique Graphical Representations. Discrete Mathematics, 306, 1253-1256.
https://corescholar.libraries.wright.edu/math/322