Notes on a theorem of Naji

Discrete Mathematics（2017）

引用 2|浏览7

暂无评分

摘要

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.

查看译文

关键词

Circle graph,Graphic matroid,Permutation graph,Split decomposition

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要