| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646735 | Discrete Mathematics | 2017 | 18 Pages |
Abstract
We present a new proof of an algebraic characterization of circle graphs due to W. Naji.For bipartite graphs, Naji’s theorem is equivalent to an algebraic characterization of planar matroids due to J. Geelen and B. Gerards. Naji’s theorem also yields an algebraic characterization of permutation graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Lorenzo Traldi,