On minimal forbidden subgraph characterizations of balanced graphs

Autores
Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret K.
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes.
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. Instituto de Cálculo; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Safe, Martin Dario. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Wagler, Annegret K.. Universite Blaise Pascal; Francia
Materia
Balanced Graphs
Bipartite Graphs
Hereditary Clique.Helly Graphs
Line Graphs
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/18827
Acceder
id CONICETDig_1ef626457e353a77dcec24eb372ee3d7
oai_identifier_str oai:ri.conicet.gov.ar:11336/18827
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling On minimal forbidden subgraph characterizations of balanced graphsBonomo, FlaviaDuran, Guillermo AlfredoSafe, Martin DarioWagler, Annegret K.Balanced GraphsBipartite GraphsHereditary Clique.Helly GraphsLine GraphsPerfect 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-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes.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. Instituto de Cálculo; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Safe, Martin Dario. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Wagler, Annegret K.. Universite Blaise Pascal; FranciaElsevier Science2013-09info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/18827Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret K.; On minimal forbidden subgraph characterizations of balanced graphs; Elsevier Science; Discrete Applied Mathematics; 161; 13-14; 9-2013; 1925-19420166-218XCONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2013.04.001info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0166218X13001741info: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-09-10T13:05:00Zoai:ri.conicet.gov.ar:11336/18827instacron: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-09-10 13:05:01.197CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv On minimal forbidden subgraph characterizations of balanced graphs
title On minimal forbidden subgraph characterizations of balanced graphs
spellingShingle On minimal forbidden subgraph characterizations of balanced graphs
Bonomo, Flavia
Balanced Graphs
Bipartite Graphs
Hereditary Clique.Helly Graphs
Line Graphs
Perfect Graphs
title_short On minimal forbidden subgraph characterizations of balanced graphs
title_full On minimal forbidden subgraph characterizations of balanced graphs
title_fullStr On minimal forbidden subgraph characterizations of balanced graphs
title_full_unstemmed On minimal forbidden subgraph characterizations of balanced graphs
title_sort On minimal forbidden subgraph characterizations of balanced 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
Bipartite Graphs
Hereditary Clique.Helly Graphs
Line Graphs
Perfect Graphs
topic Balanced Graphs
Bipartite Graphs
Hereditary Clique.Helly Graphs
Line Graphs
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-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes.
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. Instituto de Cálculo; Argentina. Universidad de Chile; Chile. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Safe, Martin Dario. Universidad Nacional de General Sarmiento. Instituto de Ciencias; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Wagler, Annegret K.. Universite Blaise Pascal; Francia
description A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes.
publishDate 2013
dc.date.none.fl_str_mv 2013-09
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/18827
Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret K.; On minimal forbidden subgraph characterizations of balanced graphs; Elsevier Science; Discrete Applied Mathematics; 161; 13-14; 9-2013; 1925-1942
0166-218X
CONICET Digital
CONICET
url http://hdl.handle.net/11336/18827
identifier_str_mv Bonomo, Flavia; Duran, Guillermo Alfredo; Safe, Martin Dario; Wagler, Annegret K.; On minimal forbidden subgraph characterizations of balanced graphs; Elsevier Science; Discrete Applied Mathematics; 161; 13-14; 9-2013; 1925-1942
0166-218X
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2013.04.001
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0166218X13001741
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
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_ 1842980172171575296
score 12.993085

Publicaciones similares