Notes on a theorem of Naji

详细信息    查看全文

• 作者：Lorenzo Traldi ^{traldil@lafayette.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Circle graph ; Graphic matroid ; Permutation graph ; Split decomposition
• 刊名：Discrete Mathematics
• 出版年：2017
• 出版时间：6 January 2017
• 年：2017
• 卷：340
• 期：1
• 页码：3217-3234
• 全文大小：505 K

文摘

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.