| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4625177 | Advances in Applied Mathematics | 2009 | 7 Pages |
Abstract
In this paper, we settle a conjecture made by Wu. We show that a 3-connected binary matroid M is graphic if and only if each element avoids exactly r(M)−1 non-separating cocircuits of M. This result is a natural companion to the following theorem of Bixby and Cunningham: a 3-connected binary matroid M is graphic if and only if each element belongs to exactly 2 non-separating cocircuits of M.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
