Notes on a theorem of Naji
classification
🧮 math.CO
keywords
najialgebraiccharacterizationgraphstheorembipartitecircleequivalent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.