Comparing trees characteristic to chordal and dually chordal graphs

Autores
De Caria, Pablo Jesús; Gutiérrez, 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.
Facultad de Ciencias Exactas
Departamento de Matemática
Materia
Ciencias Exactas
Matemática
chordal graph
dually chordal graph
clique tree
compatible tree
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/162528
Acceder
id SEDICI_80e9efb3c3f283545f93e2f4e1e6191d
oai_identifier_str oai:sedici.unlp.edu.ar:10915/162528
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Comparing trees characteristic to chordal and dually chordal graphsDe Caria, Pablo JesúsGutiérrez, MarisaCiencias ExactasMatemáticachordal graphdually chordal graphclique treecompatible treeChordal 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.Facultad de Ciencias ExactasDepartamento de Matemática2011-08info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf33-38http://sedici.unlp.edu.ar/handle/10915/162528enginfo:eu-repo/semantics/altIdentifier/issn/1571-0653info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2011.05.007info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/Creative Commons Attribution 4.0 International (CC BY 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T11:34:32Zoai:sedici.unlp.edu.ar:10915/162528Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 11:34:33.051SEDICI (UNLP) - Universidad Nacional de La Platafalse
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
Ciencias Exactas
Matemática
chordal graph
dually chordal graph
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
Gutiérrez, Marisa
author De Caria, Pablo Jesús
author_facet De Caria, Pablo Jesús
Gutiérrez, Marisa
author_role author
author2 Gutiérrez, Marisa
author2_role author
dc.subject.none.fl_str_mv Ciencias Exactas
Matemática
chordal graph
dually chordal graph
clique tree
compatible tree
topic Ciencias Exactas
Matemática
chordal graph
dually chordal graph
clique tree
compatible tree
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.
Facultad de Ciencias Exactas
Departamento de Matemática
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
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
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://sedici.unlp.edu.ar/handle/10915/162528
url http://sedici.unlp.edu.ar/handle/10915/162528
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1571-0653
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2011.05.007
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
dc.format.none.fl_str_mv application/pdf
33-38
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846064372944732160
score 13.22299

Publicaciones similares