Balancedness of some subclasses of circular-arc graphs

Autores
Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret K.
Año de publicación
2010
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. Circular-arc graphs generalize interval graphs, but are not balanced in general. In this work we characterize balanced graphs by minimal forbidden induced subgraphs restricted to graphs that belong to some classes of circular-arc 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. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Safe, Martin Dario. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Wagler, Annegret K.. Otto-von-Guericke-Universität Magdeburg; Alemania
Materia
Balanced Graphs
Circular-Arc Graphs
Forbidden Subgraphs
Perfect Graphs
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/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/16530
Acceder
id CONICETDig_341367bfb970feb780c52624cad6c8d2
oai_identifier_str oai:ri.conicet.gov.ar:11336/16530
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Balancedness of some subclasses of circular-arc graphsBonomo, FlaviaDuran, Guillermo AlfredoSafe, Martin DarioWagler, Annegret K.Balanced GraphsCircular-Arc GraphsForbidden SubgraphsPerfect Graphshttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. Circular-arc graphs generalize interval graphs, but are not balanced in general. In this work we characterize balanced graphs by minimal forbidden induced subgraphs restricted to graphs that belong to some classes of circular-arc 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. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Safe, Martin Dario. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Wagler, Annegret K.. Otto-von-Guericke-Universität Magdeburg; AlemaniaElsevier Science2010-08info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/16530Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret K.; Balancedness of some subclasses of circular-arc graphs; Elsevier Science; Electronic Notes In Discrete Mathematics; 36; 8-2010; 1121-11281571-0653enginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2010.05.142info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S1571065310001435?via%3Dihubinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T15:05:02Zoai:ri.conicet.gov.ar:11336/16530instacron: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:05:02.664CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Balancedness of some subclasses of circular-arc graphs
title Balancedness of some subclasses of circular-arc graphs
spellingShingle Balancedness of some subclasses of circular-arc graphs
Bonomo, Flavia
Balanced Graphs
Circular-Arc Graphs
Forbidden Subgraphs
Perfect Graphs
title_short Balancedness of some subclasses of circular-arc graphs
title_full Balancedness of some subclasses of circular-arc graphs
title_fullStr Balancedness of some subclasses of circular-arc graphs
title_full_unstemmed Balancedness of some subclasses of circular-arc graphs
title_sort Balancedness of some subclasses of circular-arc graphs
dc.creator.none.fl_str_mv Bonomo, Flavia
Duran, Guillermo Alfredo
Safe, Martin Dario
Wagler, Annegret K.
author Bonomo, Flavia
author_facet Bonomo, Flavia
Duran, Guillermo Alfredo
Safe, Martin Dario
Wagler, Annegret K.
author_role author
author2 Duran, Guillermo Alfredo
Safe, Martin Dario
Wagler, Annegret K.
author2_role author
author
author
dc.subject.none.fl_str_mv Balanced Graphs
Circular-Arc Graphs
Forbidden Subgraphs
Perfect Graphs
topic Balanced Graphs
Circular-Arc Graphs
Forbidden Subgraphs
Perfect Graphs
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.2
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. Circular-arc graphs generalize interval graphs, but are not balanced in general. In this work we characterize balanced graphs by minimal forbidden induced subgraphs restricted to graphs that belong to some classes of circular-arc 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. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Safe, Martin Dario. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Wagler, Annegret K.. Otto-von-Guericke-Universität Magdeburg; Alemania
description A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. Circular-arc graphs generalize interval graphs, but are not balanced in general. In this work we characterize balanced graphs by minimal forbidden induced subgraphs restricted to graphs that belong to some classes of circular-arc graphs.
publishDate 2010
dc.date.none.fl_str_mv 2010-08
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/16530
Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret K.; Balancedness of some subclasses of circular-arc graphs; Elsevier Science; Electronic Notes In Discrete Mathematics; 36; 8-2010; 1121-1128
1571-0653
url http://hdl.handle.net/11336/16530
identifier_str_mv Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret K.; Balancedness of some subclasses of circular-arc graphs; Elsevier Science; Electronic Notes In Discrete Mathematics; 36; 8-2010; 1121-1128
1571-0653
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2010.05.142
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S1571065310001435?via%3Dihub
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier 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_ 1846083192926240768
score 13.216834

Publicaciones similares