| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656714 | Journal of Combinatorial Theory, Series B | 2016 | 7 Pages |
Abstract
It is shown that a binary matroid is graphic if and only if it does not contain four circuits that interact is a particular way. This result generalizes a theorem of Little and Sanjith for planar graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Donald K. Wagner,