| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657266 | Journal of Combinatorial Theory, Series B | 2008 | 6 Pages |
Abstract
We give a necessary and sufficient condition for a binary matroid to be graphic. The condition is very natural, but, unlike other similar results, it gives a trivial algorithm for testing graphicness.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
