Bipartite graphs that are not circle graphs
From MaRDI portal
Publication:1296144
DOI10.5802/aif.1693zbMath0917.05064OpenAlexW2073184388MaRDI QIDQ1296144
Publication date: 12 July 1999
Published in: Annales de l'Institut Fourier (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=AIF_1999__49_3_809_0
Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)
Related Items (5)
Notes on a theorem of Naji ⋮ Bipartite complements of circle graphs ⋮ On polygon numbers of circle graphs and distance hereditary graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Forbidden induced subgraph characterization of circle graphs within split graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphes de cordes et espaces graphiques
- A characterization of circle graphs
- A characterization of unimodular orientations of simple graphs
- Reconnaissance des graphes de cordes
- Graphic presentations of isotropic systems
- Circle graph obstructions
- A proof of a circle graph characterization
- Lectures on matroids
This page was built for publication: Bipartite graphs that are not circle graphs
