Notes on a theorem of Naji

DOI10.1016/j.disc.2016.07.019zbMath1347.05096arXiv1507.00593OpenAlexW1846948956MaRDI QIDQ329556

Lorenzo Traldi

Publication date: 21 October 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.00593

zbMATH Keywords

graphic matroidcircle graphpermutation graphsplit decomposition

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Bipartite complements of circle graphs ⋮ A characterization of circle graphs in terms of multimatroid representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing graphic matroids by a system of linear equations
• Practical and efficient circle graph recognition
• Partial characterizations of circle graphs
• Isotropic matroids. II: Circle graphs
• Circle graphs and monadic second-order logic
• Diamond-free circle graphs are Helly circle
• Reconnaissance des graphes de cordes
• Distance-hereditary graphs
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• Local complementation and interlacement graphs
• Cycle decomposition by disjoint transpositions
• Bipartite graphs that are not circle graphs
• Circle graph obstructions
• Isotropic matroids. III: Connectivity
• Decomposition of Directed Graphs
• Recognition of Circle Graphs
• Recognizing circle graphs in polynomial time

This page was built for publication: Notes on a theorem of Naji