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 Ω.
Original language | English |
---|---|
Pages (from-to) | 1253-1256 |
Number of pages | 4 |
Journal | Discrete Mathematics |
Volume | 306 |
Issue number | 12 |
DOIs | |
State | Published - Jun 28 2006 |
ASJC Scopus Subject Areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Keywords
- Bias matroids
- Biased graphs
- Frame matroids
Disciplines
- Applied Mathematics
- Applied Statistics
- Mathematics