Partial characterizations of circle graphs

Autores
Bonomo, F.; Durán, G.; Grippo, L.N.; Safe, M.D.
Año de publicación
2011
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Grippo, L.N. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Safe, M.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fuente
Discrete Appl Math 2011;159(16):1699-1706
Materia
P 4-tidy graphs
Circle graphs
Helly circle graphs
Linear domino graphs
Tree-cographs
Unit circle graphs
<sup>P 4</sup>-tidy graphs
Circle graphs
Helly circle graphs
Linear domino graphs
Tree-cographs
Unit circles
Graphic methods
Plant extracts
Trees (mathematics)
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/2.5/ar
Repositorio
Biblioteca Digital (UBA-FCEN)
Institución
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
OAI Identificador
paperaa:paper_0166218X_v159_n16_p1699_Bonomo
Acceder
id BDUBAFCEN_be504f6a5281eaee9fe0ebc5cf2f2d2d
oai_identifier_str paperaa:paper_0166218X_v159_n16_p1699_Bonomo
network_acronym_str BDUBAFCEN
repository_id_str 1896
network_name_str Biblioteca Digital (UBA-FCEN)
spelling Partial characterizations of circle graphsBonomo, F.Durán, G.Grippo, L.N.Safe, M.D.P 4-tidy graphsCircle graphsHelly circle graphsLinear domino graphsTree-cographsUnit circle graphs<sup>P 4</sup>-tidy graphsCircle graphsHelly circle graphsLinear domino graphsTree-cographsUnit circlesGraphic methodsPlant extractsTrees (mathematics)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.Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Grippo, L.N. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Safe, M.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.2011info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://hdl.handle.net/20.500.12110/paper_0166218X_v159_n16_p1699_BonomoDiscrete Appl Math 2011;159(16):1699-1706reponame:Biblioteca Digital (UBA-FCEN)instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesinstacron:UBA-FCENenginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/2.5/ar2025-09-04T09:48:37Zpaperaa:paper_0166218X_v159_n16_p1699_BonomoInstitucionalhttps://digital.bl.fcen.uba.ar/Universidad públicaNo correspondehttps://digital.bl.fcen.uba.ar/cgi-bin/oaiserver.cgiana@bl.fcen.uba.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:18962025-09-04 09:48:39.369Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesfalse
dc.title.none.fl_str_mv Partial characterizations of circle graphs
title Partial characterizations of circle graphs
spellingShingle Partial characterizations of circle graphs
Bonomo, F.
P 4-tidy graphs
Circle graphs
Helly circle graphs
Linear domino graphs
Tree-cographs
Unit circle graphs
<sup>P 4</sup>-tidy graphs
Circle graphs
Helly circle graphs
Linear domino graphs
Tree-cographs
Unit circles
Graphic methods
Plant extracts
Trees (mathematics)
title_short Partial characterizations of circle graphs
title_full Partial characterizations of circle graphs
title_fullStr Partial characterizations of circle graphs
title_full_unstemmed Partial characterizations of circle graphs
title_sort Partial characterizations of circle graphs
dc.creator.none.fl_str_mv Bonomo, F.
Durán, G.
Grippo, L.N.
Safe, M.D.
author Bonomo, F.
author_facet Bonomo, F.
Durán, G.
Grippo, L.N.
Safe, M.D.
author_role author
author2 Durán, G.
Grippo, L.N.
Safe, M.D.
author2_role author
author
author
dc.subject.none.fl_str_mv P 4-tidy graphs
Circle graphs
Helly circle graphs
Linear domino graphs
Tree-cographs
Unit circle graphs
<sup>P 4</sup>-tidy graphs
Circle graphs
Helly circle graphs
Linear domino graphs
Tree-cographs
Unit circles
Graphic methods
Plant extracts
Trees (mathematics)
topic P 4-tidy graphs
Circle graphs
Helly circle graphs
Linear domino graphs
Tree-cographs
Unit circle graphs
<sup>P 4</sup>-tidy graphs
Circle graphs
Helly circle graphs
Linear domino graphs
Tree-cographs
Unit circles
Graphic methods
Plant extracts
Trees (mathematics)
dc.description.none.fl_txt_mv 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.
Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Grippo, L.N. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Safe, M.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n16_p1699_Bonomo
url http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n16_p1699_Bonomo
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/2.5/ar
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/2.5/ar
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv Discrete Appl Math 2011;159(16):1699-1706
reponame:Biblioteca Digital (UBA-FCEN)
instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN
reponame_str Biblioteca Digital (UBA-FCEN)
collection Biblioteca Digital (UBA-FCEN)
instname_str Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron_str UBA-FCEN
institution UBA-FCEN
repository.name.fl_str_mv Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
repository.mail.fl_str_mv ana@bl.fcen.uba.ar
_version_ 1842340705272332288
score 12.623145

Publicaciones similares