A circle graph is an intersection graph of a non-empty finite set of chords of a circle. By using a theorem of Bouchet, this paper redemonstrates easily a result obtained by Naji which characterizes circle graphs by resolving a system of linear equations of \(\text{GF}(2)\).
Recommendations
Cites work
- A characterization of circle graphs
- Circle graph obstructions
- Graphes de cordes et espaces graphiques
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Local complementation and interlacement graphs
- Recognition of Circle Graphs
- Reconnaissance des graphes de cordes
- Reducing prime graphs and recognizing circle graphs
- Unimodularity and circle graphs
Cited in
(17)- Unimodularity and circle graphs
- Bipartite graphs that are not circle graphs
- Circle graph obstructions
- Formal systems for gene assembly in ciliates.
- A characterization of circle graphs in terms of total unimodularity
- Bipartite complements of circle graphs
- A characterization of circle graphs in terms of multimatroid representations
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Notes on a theorem of Naji
- Circle graph obstructions under pivoting
- scientific article; zbMATH DE number 1933269 (Why is no real title available?)
- scientific article; zbMATH DE number 3997838 (Why is no real title available?)
- On the Circular Area Signature for Graphs
- Naji's characterization of circle graphs
- Distance Hereditary Graphs and the Interlace Polynomial
- Isotropic matroids. II: Circle graphs
- A characterization of circle graphs
This page was built for publication: A proof of a circle graph characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367045)
