Families of induced trees and their intersection graphs

Autores
De Caria, Pablo Jesús
Año de publicación
2019
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
This paper is inspired in the well known characterization of chordal graphs as the intersection graphs of subtrees of a tree. We consider families of induced trees of any graph and we prove that their recognition is NP-Complete. A consequence of this fact is that the concept of clique tree of chordal graphs cannot be widely generalized. Finally, we consider the fact that every graph is the intersection graph of induced trees of a bipartite graph and we characterize some classes that arise when we impose restrictions on the host bipartite graph.
Facultad de Ciencias Exactas
Materia
Matemática
Subtree
Intersection Graph
Clique Tree
Bipartite Graph
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-nd/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/159867
Acceder
id SEDICI_18fbd0788d7c5ee3f7dafb1c834d032c
oai_identifier_str oai:sedici.unlp.edu.ar:10915/159867
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Families of induced trees and their intersection graphsDe Caria, Pablo JesúsMatemáticaSubtreeIntersection GraphClique TreeBipartite GraphThis paper is inspired in the well known characterization of chordal graphs as the intersection graphs of subtrees of a tree. We consider families of induced trees of any graph and we prove that their recognition is NP-Complete. A consequence of this fact is that the concept of clique tree of chordal graphs cannot be widely generalized. Finally, we consider the fact that every graph is the intersection graph of induced trees of a bipartite graph and we characterize some classes that arise when we impose restrictions on the host bipartite graph.Facultad de Ciencias Exactas2019info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/159867enginfo:eu-repo/semantics/altIdentifier/issn/1571-0661info:eu-repo/semantics/altIdentifier/doi/10.1016/j.entcs.2019.08.024info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/4.0/Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T11:13:48Zoai:sedici.unlp.edu.ar:10915/159867Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 11:13:49.138SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Families of induced trees and their intersection graphs
title Families of induced trees and their intersection graphs
spellingShingle Families of induced trees and their intersection graphs
De Caria, Pablo Jesús
Matemática
Subtree
Intersection Graph
Clique Tree
Bipartite Graph
title_short Families of induced trees and their intersection graphs
title_full Families of induced trees and their intersection graphs
title_fullStr Families of induced trees and their intersection graphs
title_full_unstemmed Families of induced trees and their intersection graphs
title_sort Families of induced trees and their intersection graphs
dc.creator.none.fl_str_mv De Caria, Pablo Jesús
author De Caria, Pablo Jesús
author_facet De Caria, Pablo Jesús
author_role author
dc.subject.none.fl_str_mv Matemática
Subtree
Intersection Graph
Clique Tree
Bipartite Graph
topic Matemática
Subtree
Intersection Graph
Clique Tree
Bipartite Graph
dc.description.none.fl_txt_mv This paper is inspired in the well known characterization of chordal graphs as the intersection graphs of subtrees of a tree. We consider families of induced trees of any graph and we prove that their recognition is NP-Complete. A consequence of this fact is that the concept of clique tree of chordal graphs cannot be widely generalized. Finally, we consider the fact that every graph is the intersection graph of induced trees of a bipartite graph and we characterize some classes that arise when we impose restrictions on the host bipartite graph.
Facultad de Ciencias Exactas
description This paper is inspired in the well known characterization of chordal graphs as the intersection graphs of subtrees of a tree. We consider families of induced trees of any graph and we prove that their recognition is NP-Complete. A consequence of this fact is that the concept of clique tree of chordal graphs cannot be widely generalized. Finally, we consider the fact that every graph is the intersection graph of induced trees of a bipartite graph and we characterize some classes that arise when we impose restrictions on the host bipartite graph.
publishDate 2019
dc.date.none.fl_str_mv 2019
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/159867
url http://sedici.unlp.edu.ar/handle/10915/159867
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1571-0661
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.entcs.2019.08.024
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/4.0/
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-nd/4.0/
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
dc.format.none.fl_str_mv application/pdf
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_ 1842260643243098112
score 13.13397

Publicaciones similares