Balancedness of subclasses of circular-arc graphs

Autores
Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret Katrin
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
A graph is balanced if its clique-vertex incidence matrix contains no square submatrix of odd order with exactly two ones per row and per column. There is a characterization of balanced graphs by forbidden induced subgraphs, but no characterization by mininal forbidden induced subgraphs is known, not even for the case of circular-arc graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. In this work, we characterize when a given graph G is balanced in terms of minimal forbidden induced subgraphs, by restricting the analysis to the case where G belongs to certain classes of circular-arc graphs, including Helly circular-arc graphs, claw-free circular-arc graphs, and gem-free circular-arc graphs. In the case of gem-free circular-arc graphs, analogous characterizations are derived for two superclasses of balanced graphs: clique-perfect graphs and coordinated graphs.
Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Duran, Guillermo Alfredo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad de Chile; Chile
Fil: Safe, Martin Dario. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina
Fil: Wagler, Annegret Katrin. Centre National de la Recherche Scientifique; Francia
Materia
balanced graphs
clique-perfect graphs
circular-arc graphs
coordinated graphs
perfect graphs
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/31293
Acceder
id CONICETDig_4407a48200e9291859fd504e6031519c
oai_identifier_str oai:ri.conicet.gov.ar:11336/31293
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Balancedness of subclasses of circular-arc graphsBonomo, FlaviaDuran, Guillermo AlfredoSafe, Martin DarioWagler, Annegret Katrinbalanced graphsclique-perfect graphscircular-arc graphscoordinated graphsperfect graphshttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1A graph is balanced if its clique-vertex incidence matrix contains no square submatrix of odd order with exactly two ones per row and per column. There is a characterization of balanced graphs by forbidden induced subgraphs, but no characterization by mininal forbidden induced subgraphs is known, not even for the case of circular-arc graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. In this work, we characterize when a given graph G is balanced in terms of minimal forbidden induced subgraphs, by restricting the analysis to the case where G belongs to certain classes of circular-arc graphs, including Helly circular-arc graphs, claw-free circular-arc graphs, and gem-free circular-arc graphs. In the case of gem-free circular-arc graphs, analogous characterizations are derived for two superclasses of balanced graphs: clique-perfect graphs and coordinated graphs.Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Duran, Guillermo Alfredo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad de Chile; ChileFil: Safe, Martin Dario. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; ArgentinaFil: Wagler, Annegret Katrin. Centre National de la Recherche Scientifique; FranciaDiscrete Mathematics and Theoretical Computer Science2014-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/31293Wagler, Annegret Katrin; Safe, Martin Dario; Duran, Guillermo Alfredo; Bonomo, Flavia; Balancedness of subclasses of circular-arc graphs; Discrete Mathematics and Theoretical Computer Science; Discrete Mathematics and Theoretical Computer Science; 16; 3; 3-2014; 1-221365-8050CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2358.1.htmlinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T15:16:37Zoai:ri.conicet.gov.ar:11336/31293instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 15:16:38.183CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Balancedness of subclasses of circular-arc graphs
title Balancedness of subclasses of circular-arc graphs
spellingShingle Balancedness of subclasses of circular-arc graphs
Bonomo, Flavia
balanced graphs
clique-perfect graphs
circular-arc graphs
coordinated graphs
perfect graphs
title_short Balancedness of subclasses of circular-arc graphs
title_full Balancedness of subclasses of circular-arc graphs
title_fullStr Balancedness of subclasses of circular-arc graphs
title_full_unstemmed Balancedness of subclasses of circular-arc graphs
title_sort Balancedness of subclasses of circular-arc graphs
dc.creator.none.fl_str_mv Bonomo, Flavia
Duran, Guillermo Alfredo
Safe, Martin Dario
Wagler, Annegret Katrin
author Bonomo, Flavia
author_facet Bonomo, Flavia
Duran, Guillermo Alfredo
Safe, Martin Dario
Wagler, Annegret Katrin
author_role author
author2 Duran, Guillermo Alfredo
Safe, Martin Dario
Wagler, Annegret Katrin
author2_role author
author
author
dc.subject.none.fl_str_mv balanced graphs
clique-perfect graphs
circular-arc graphs
coordinated graphs
perfect graphs
topic balanced graphs
clique-perfect graphs
circular-arc graphs
coordinated graphs
perfect graphs
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv A graph is balanced if its clique-vertex incidence matrix contains no square submatrix of odd order with exactly two ones per row and per column. There is a characterization of balanced graphs by forbidden induced subgraphs, but no characterization by mininal forbidden induced subgraphs is known, not even for the case of circular-arc graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. In this work, we characterize when a given graph G is balanced in terms of minimal forbidden induced subgraphs, by restricting the analysis to the case where G belongs to certain classes of circular-arc graphs, including Helly circular-arc graphs, claw-free circular-arc graphs, and gem-free circular-arc graphs. In the case of gem-free circular-arc graphs, analogous characterizations are derived for two superclasses of balanced graphs: clique-perfect graphs and coordinated graphs.
Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Duran, Guillermo Alfredo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad de Chile; Chile
Fil: Safe, Martin Dario. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina
Fil: Wagler, Annegret Katrin. Centre National de la Recherche Scientifique; Francia
description A graph is balanced if its clique-vertex incidence matrix contains no square submatrix of odd order with exactly two ones per row and per column. There is a characterization of balanced graphs by forbidden induced subgraphs, but no characterization by mininal forbidden induced subgraphs is known, not even for the case of circular-arc graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. In this work, we characterize when a given graph G is balanced in terms of minimal forbidden induced subgraphs, by restricting the analysis to the case where G belongs to certain classes of circular-arc graphs, including Helly circular-arc graphs, claw-free circular-arc graphs, and gem-free circular-arc graphs. In the case of gem-free circular-arc graphs, analogous characterizations are derived for two superclasses of balanced graphs: clique-perfect graphs and coordinated graphs.
publishDate 2014
dc.date.none.fl_str_mv 2014-03
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/11336/31293
Wagler, Annegret Katrin; Safe, Martin Dario; Duran, Guillermo Alfredo; Bonomo, Flavia; Balancedness of subclasses of circular-arc graphs; Discrete Mathematics and Theoretical Computer Science; Discrete Mathematics and Theoretical Computer Science; 16; 3; 3-2014; 1-22
1365-8050
CONICET Digital
CONICET
url http://hdl.handle.net/11336/31293
identifier_str_mv Wagler, Annegret Katrin; Safe, Martin Dario; Duran, Guillermo Alfredo; Bonomo, Flavia; Balancedness of subclasses of circular-arc graphs; Discrete Mathematics and Theoretical Computer Science; Discrete Mathematics and Theoretical Computer Science; 16; 3; 3-2014; 1-22
1365-8050
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2358.1.html
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Discrete Mathematics and Theoretical Computer Science
publisher.none.fl_str_mv Discrete Mathematics and Theoretical Computer Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846083315065421824
score 13.22299

Publicaciones similares