## Abstract A circular‐arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular‐arc graphs by a list of minim
Partial characterizations of circle graphs
✍ Scribed by Flavia Bonomo; Guillermo Durán; Luciano N. Grippo; Martín D. Safe
- Book ID
- 113564596
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 324 KB
- Volume
- 159
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A circle graph is an intersection graph of a non-empty finite set of chords of a circle. By using a theorem of Bouchet, we redemonstrate easily a result obtained by Naji which characterizes circle graphs by resolving a system of linear equations of GF(2). The graphs that we consider are simple. A g
The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attem
## Abstract The possible classes of balanced circles of a signed graph are characterized in two ways.