Comparing trees characteristic to chordal and dually chordal graphs

Autores
de Caria, Pablo Jesús; Gutierrez, Marisa
Año de publicación
2011
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively. The following problem is studied: given a chordal graph G, it has to be determined if the clique trees of G are exactly the compatible trees of K(G). This does not always happen. A necessary and sufficient condition so that it is true, in terms of the minimal vertex separators of the graph, is found.
Fil: de Caria, Pablo Jesús. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata; Argentina
Fil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata; Argentina
Materia
CHORDAL
DUALLY CHORDAL
CLIQUE TREE
COMPATIBLE TREE
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/95040
Acceder
id CONICETDig_eaa0c77bf46e27fc12811759824992ae
oai_identifier_str oai:ri.conicet.gov.ar:11336/95040
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Comparing trees characteristic to chordal and dually chordal graphsde Caria, Pablo JesúsGutierrez, MarisaCHORDALDUALLY CHORDALCLIQUE TREECOMPATIBLE TREEhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively. The following problem is studied: given a chordal graph G, it has to be determined if the clique trees of G are exactly the compatible trees of K(G). This does not always happen. A necessary and sufficient condition so that it is true, in terms of the minimal vertex separators of the graph, is found.Fil: de Caria, Pablo Jesús. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata; ArgentinaFil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata; ArgentinaElsevier2011-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/95040de Caria, Pablo Jesús; Gutierrez, Marisa; Comparing trees characteristic to chordal and dually chordal graphs; Elsevier; Electronic Notes in Discrete Mathematics; 37; 1-8-2011; 33-381571-0653CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065311000084info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2011.05.007info: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:40:00Zoai:ri.conicet.gov.ar:11336/95040instacron: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:40:00.69CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Comparing trees characteristic to chordal and dually chordal graphs
title Comparing trees characteristic to chordal and dually chordal graphs
spellingShingle Comparing trees characteristic to chordal and dually chordal graphs
de Caria, Pablo Jesús
CHORDAL
DUALLY CHORDAL
CLIQUE TREE
COMPATIBLE TREE
title_short Comparing trees characteristic to chordal and dually chordal graphs
title_full Comparing trees characteristic to chordal and dually chordal graphs
title_fullStr Comparing trees characteristic to chordal and dually chordal graphs
title_full_unstemmed Comparing trees characteristic to chordal and dually chordal graphs
title_sort Comparing trees characteristic to chordal and dually chordal graphs
dc.creator.none.fl_str_mv de Caria, Pablo Jesús
Gutierrez, Marisa
author de Caria, Pablo Jesús
author_facet de Caria, Pablo Jesús
Gutierrez, Marisa
author_role author
author2 Gutierrez, Marisa
author2_role author
dc.subject.none.fl_str_mv CHORDAL
DUALLY CHORDAL
CLIQUE TREE
COMPATIBLE TREE
topic CHORDAL
DUALLY CHORDAL
CLIQUE TREE
COMPATIBLE TREE
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively. The following problem is studied: given a chordal graph G, it has to be determined if the clique trees of G are exactly the compatible trees of K(G). This does not always happen. A necessary and sufficient condition so that it is true, in terms of the minimal vertex separators of the graph, is found.
Fil: de Caria, Pablo Jesús. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata; Argentina
Fil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata; Argentina
description Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively. The following problem is studied: given a chordal graph G, it has to be determined if the clique trees of G are exactly the compatible trees of K(G). This does not always happen. A necessary and sufficient condition so that it is true, in terms of the minimal vertex separators of the graph, is found.
publishDate 2011
dc.date.none.fl_str_mv 2011-08-01
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/95040
de Caria, Pablo Jesús; Gutierrez, Marisa; Comparing trees characteristic to chordal and dually chordal graphs; Elsevier; Electronic Notes in Discrete Mathematics; 37; 1-8-2011; 33-38
1571-0653
CONICET Digital
CONICET
url http://hdl.handle.net/11336/95040
identifier_str_mv de Caria, Pablo Jesús; Gutierrez, Marisa; Comparing trees characteristic to chordal and dually chordal graphs; Elsevier; Electronic Notes in Discrete Mathematics; 37; 1-8-2011; 33-38
1571-0653
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.sciencedirect.com/science/article/pii/S1571065311000084
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2011.05.007
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
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
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_ 1846083515212365824
score 13.22299

Publicaciones similares