### Multimatroids. II: Orthogonality, minors and connectivity.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Back to Simple Search
# Advanced Search

The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in $\mathrm{GF}\left(2\right)$. At the end of this short note I briefly recall the work of François Jaeger on circle graphs.

**Page 1**