Asteroidal quadruples in non rooted path graphs

Autores
Gutiérrez, Marisa; Leveque, Benjamín; Tondato, Silvia B.
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.
Facultad de Ciencias Exactas
Materia
Matemática
Asteroidal quadruples
Clique trees
Rooted path graphs
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/85929

id SEDICI_c031f597afe06700cf33c0f0befdff0f
oai_identifier_str oai:sedici.unlp.edu.ar:10915/85929
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Asteroidal quadruples in non rooted path graphsGutiérrez, MarisaLeveque, BenjamínTondato, Silvia B.MatemáticaAsteroidal quadruplesClique treesRooted path graphsA directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.Facultad de Ciencias Exactas2015info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf603-614http://sedici.unlp.edu.ar/handle/10915/85929enginfo:eu-repo/semantics/altIdentifier/issn/1234-3099info:eu-repo/semantics/altIdentifier/doi/10.7151/dmgt.1821info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:49:17Zoai:sedici.unlp.edu.ar:10915/85929Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:49:17.658SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Asteroidal quadruples in non rooted path graphs
title Asteroidal quadruples in non rooted path graphs
spellingShingle Asteroidal quadruples in non rooted path graphs
Gutiérrez, Marisa
Matemática
Asteroidal quadruples
Clique trees
Rooted path graphs
title_short Asteroidal quadruples in non rooted path graphs
title_full Asteroidal quadruples in non rooted path graphs
title_fullStr Asteroidal quadruples in non rooted path graphs
title_full_unstemmed Asteroidal quadruples in non rooted path graphs
title_sort Asteroidal quadruples in non rooted path graphs
dc.creator.none.fl_str_mv Gutiérrez, Marisa
Leveque, Benjamín
Tondato, Silvia B.
author Gutiérrez, Marisa
author_facet Gutiérrez, Marisa
Leveque, Benjamín
Tondato, Silvia B.
author_role author
author2 Leveque, Benjamín
Tondato, Silvia B.
author2_role author
author
dc.subject.none.fl_str_mv Matemática
Asteroidal quadruples
Clique trees
Rooted path graphs
topic Matemática
Asteroidal quadruples
Clique trees
Rooted path graphs
dc.description.none.fl_txt_mv A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.
Facultad de Ciencias Exactas
description A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.
publishDate 2015
dc.date.none.fl_str_mv 2015
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/85929
url http://sedici.unlp.edu.ar/handle/10915/85929
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1234-3099
info:eu-repo/semantics/altIdentifier/doi/10.7151/dmgt.1821
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
603-614
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_ 1842260369236557824
score 13.13397