Partial characterizations of circle graphs
A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden ind...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | Argentina |
| Institución: | Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales |
| Repositorio: | Biblioteca Digital (UBA-FCEN) |
| Idioma: | inglés |
| OAI Identifier: | paperaa:paper_0166218X_v159_n16_p1699_Bonomo |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n16_p1699_Bonomo |
| Access Level: | acceso abierto |
| Palabra clave: | P 4-tidy graphs Circle graphs Helly circle graphs Linear domino graphs Tree-cographs Unit circle graphs <sup>P 4</sup>-tidy graphs Unit circles Graphic methods Plant extracts Trees (mathematics) |
| Sumario: | A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-tidy graphs, and tree-cographs. We also completely characterize by minimal forbidden induced subgraphs the class of unit Helly circle graphs, which are those circle graphs having a model whose chords have all the same length, are pairwise different, and satisfy the Helly property. © 2010 Elsevier B.V. All rights reserved. |
|---|