A proof of a circle graph characterization
From MaRDI portal
Publication:1367045
DOI10.1016/S0012-365X(97)00068-XzbMATH Open0882.05111OpenAlexW2067038884MaRDI QIDQ1367045FDOQ1367045
Publication date: 24 February 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00068-x
Cites Work
- Title not available (Why is that?)
- Circle graph obstructions
- Recognition of Circle Graphs
- Reconnaissance des graphes de cordes
- Reducing prime graphs and recognizing circle graphs
- Local complementation and interlacement graphs
- Graphes de cordes et espaces graphiques
- Unimodularity and circle graphs
- A characterization of circle graphs
Cited In (8)
- Distance Hereditary Graphs and the Interlace Polynomial
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Naji's characterization of circle graphs
- A characterization of circle graphs in terms of multimatroid representations
- Formal systems for gene assembly in ciliates.
- On the Circular Area Signature for Graphs
- Bipartite complements of circle graphs
- Bipartite graphs that are not 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)
