Balancedness of some subclasses of circular-arc graphs

Autores
Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret Katrin
Año de publicación
2010
Idioma
inglés
Tipo de recurso
documento de conferencia
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. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló". Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina
Fil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Calculo. - Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Calculo; Argentina
Fil: Safe, Martin Dario. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Wagler, Annegret Katrin. Otto-von-Guericke-Universität Magdeburg; Alemania
International Symposium on Combinatorial Optimization
Hammamet
Túnez
Tunisia Polytechnic School
Universidad París-Dauphine
University Paris 13
Materia
BALANCED GRAPHS
CIRCULAR-ARC GRAPHS
FORBIDDEN SUBGRAPHS
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/282010
Acceder
id CONICETDig_22136458bf4fa1f00f8150fc1e7c1b1c
oai_identifier_str oai:ri.conicet.gov.ar:11336/282010
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 KatrinBALANCED GRAPHSCIRCULAR-ARC GRAPHSFORBIDDEN SUBGRAPHSPERFECT GRAPHShttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1https://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1A 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. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló". Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; ArgentinaFil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Calculo. - Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Calculo; ArgentinaFil: Safe, Martin Dario. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Wagler, Annegret Katrin. Otto-von-Guericke-Universität Magdeburg; AlemaniaInternational Symposium on Combinatorial OptimizationHammametTúnezTunisia Polytechnic SchoolUniversidad París-DauphineUniversity Paris 13Tunisia Polytechnic School2010info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectSimposioBookhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/282010Balancedness of some subclasses of circular-arc graphs; International Symposium on Combinatorial Optimization; Hammamet; Túnez; 2010; 25-25CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/info:eu-repo/semantics/altIdentifier/url/https://www.lamsade.dauphine.fr/~isco/ISCO2010/Internacionalinfo: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écnicas2026-03-11T12:07:56Zoai:ri.conicet.gov.ar:11336/282010instacron: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:34982026-03-11 12:07:56.416CONICET 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 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
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/1.1
https://purl.org/becyt/ford/1
https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
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. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló". Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina
Fil: Duran, Guillermo Alfredo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Calculo. - Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Calculo; Argentina
Fil: Safe, Martin Dario. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Wagler, Annegret Katrin. Otto-von-Guericke-Universität Magdeburg; Alemania
International Symposium on Combinatorial Optimization
Hammamet
Túnez
Tunisia Polytechnic School
Universidad París-Dauphine
University Paris 13
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
dc.type.none.fl_str_mv info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/conferenceObject
Simposio
Book
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
status_str publishedVersion
format conferenceObject
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/282010
Balancedness of some subclasses of circular-arc graphs; International Symposium on Combinatorial Optimization; Hammamet; Túnez; 2010; 25-25
CONICET Digital
CONICET
url http://hdl.handle.net/11336/282010
identifier_str_mv Balancedness of some subclasses of circular-arc graphs; International Symposium on Combinatorial Optimization; Hammamet; Túnez; 2010; 25-25
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/
info:eu-repo/semantics/altIdentifier/url/https://www.lamsade.dauphine.fr/~isco/ISCO2010/
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
dc.coverage.none.fl_str_mv Internacional
dc.publisher.none.fl_str_mv Tunisia Polytechnic School
publisher.none.fl_str_mv Tunisia Polytechnic School
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_ 1859460050433605632
score 12.977003

Publicaciones similares