On minimal forbidden subgraph characterizations of balanced graphs

Autores
Bonomo, F.; Durán, G.; Safe, M.D.; Wagler, A.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. © 2013 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:Safe, M.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fuente
Discrete Appl Math 2013;161(13-14):1925-1942
Materia
Balanced graphs
Bipartite graphs
Hereditary clique-Helly graphs
Line graphs
Perfect graphs
Balanced graphs
Bipartite graphs
Hereditary clique-Helly graphs
Line graph
Perfect graph
Directed graphs
Graphic methods
Characterization
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_v161_n13-14_p1925_Bonomo
Acceder
id BDUBAFCEN_e8ad727851a6a826ddb00baec7d659ad
oai_identifier_str paperaa:paper_0166218X_v161_n13-14_p1925_Bonomo
network_acronym_str BDUBAFCEN
repository_id_str 1896
network_name_str Biblioteca Digital (UBA-FCEN)
spelling On minimal forbidden subgraph characterizations of balanced graphsBonomo, F.Durán, G.Safe, M.D.Wagler, A.K.Balanced graphsBipartite graphsHereditary clique-Helly graphsLine graphsPerfect graphsBalanced graphsBipartite graphsHereditary clique-Helly graphsLine graphPerfect graphDirected graphsGraphic methodsCharacterizationA 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. © 2013 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:Safe, M.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.2013info: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_v161_n13-14_p1925_BonomoDiscrete Appl Math 2013;161(13-14):1925-1942reponame: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:41Zpaperaa:paper_0166218X_v161_n13-14_p1925_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:43.276Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesfalse
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, F.
Balanced graphs
Bipartite graphs
Hereditary clique-Helly graphs
Line graphs
Perfect graphs
Balanced graphs
Bipartite graphs
Hereditary clique-Helly graphs
Line graph
Perfect graph
Directed graphs
Graphic methods
Characterization
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, F.
Durán, G.
Safe, M.D.
Wagler, A.K.
author Bonomo, F.
author_facet Bonomo, F.
Durán, G.
Safe, M.D.
Wagler, A.K.
author_role author
author2 Durán, G.
Safe, M.D.
Wagler, A.K.
author2_role author
author
author
dc.subject.none.fl_str_mv Balanced graphs
Bipartite graphs
Hereditary clique-Helly graphs
Line graphs
Perfect graphs
Balanced graphs
Bipartite graphs
Hereditary clique-Helly graphs
Line graph
Perfect graph
Directed graphs
Graphic methods
Characterization
topic Balanced graphs
Bipartite graphs
Hereditary clique-Helly graphs
Line graphs
Perfect graphs
Balanced graphs
Bipartite graphs
Hereditary clique-Helly graphs
Line graph
Perfect graph
Directed graphs
Graphic methods
Characterization
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. © 2013 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:Safe, M.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
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. © 2013 Elsevier B.V. All rights reserved.
publishDate 2013
dc.date.none.fl_str_mv 2013
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_v161_n13-14_p1925_Bonomo
url http://hdl.handle.net/20.500.12110/paper_0166218X_v161_n13-14_p1925_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 2013;161(13-14):1925-1942
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_ 1842340706716221440
score 12.623145

Publicaciones similares