Asteroidal quadruples in non rooted path graphs
- Autores
- Gutierrez, Marisa; Leveque, Benjamin; Tondato, Silvia Beatriz
- 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.
Fil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina
Fil: Leveque, Benjamin. Centre National de la Recherche Scientifique; Francia
Fil: Tondato, Silvia Beatriz. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina - Materia
-
Clique Trees
Rooted Path Graphs
Asteroidal Quadruples - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/45977
Ver los metadatos del registro completo
id |
CONICETDig_3771d0cb773edb33d44c4315b4ad728a |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/45977 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Asteroidal quadruples in non rooted path graphsGutierrez, MarisaLeveque, BenjaminTondato, Silvia BeatrizClique TreesRooted Path GraphsAsteroidal Quadrupleshttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1A 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.Fil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; ArgentinaFil: Leveque, Benjamin. Centre National de la Recherche Scientifique; FranciaFil: Tondato, Silvia Beatriz. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; ArgentinaDiscussiones Mathematicae Graph Theory2015-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/45977Gutierrez, Marisa; Leveque, Benjamin; Tondato, Silvia Beatriz; Asteroidal quadruples in non rooted path graphs; Discussiones Mathematicae Graph Theory; Discussiones Mathematicae Graph Theory; 35; 4; 1-2015; 603-6142083-5892CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.7151/dmgt.1821info:eu-repo/semantics/altIdentifier/url/http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1821info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:52:27Zoai:ri.conicet.gov.ar:11336/45977instacron: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-09-03 09:52:27.894CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
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 Gutierrez, Marisa Clique Trees Rooted Path Graphs Asteroidal Quadruples |
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 |
Gutierrez, Marisa Leveque, Benjamin Tondato, Silvia Beatriz |
author |
Gutierrez, Marisa |
author_facet |
Gutierrez, Marisa Leveque, Benjamin Tondato, Silvia Beatriz |
author_role |
author |
author2 |
Leveque, Benjamin Tondato, Silvia Beatriz |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Clique Trees Rooted Path Graphs Asteroidal Quadruples |
topic |
Clique Trees Rooted Path Graphs Asteroidal Quadruples |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
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. Fil: Gutierrez, Marisa. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina Fil: Leveque, Benjamin. Centre National de la Recherche Scientifique; Francia Fil: Tondato, Silvia Beatriz. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina |
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-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/45977 Gutierrez, Marisa; Leveque, Benjamin; Tondato, Silvia Beatriz; Asteroidal quadruples in non rooted path graphs; Discussiones Mathematicae Graph Theory; Discussiones Mathematicae Graph Theory; 35; 4; 1-2015; 603-614 2083-5892 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/45977 |
identifier_str_mv |
Gutierrez, Marisa; Leveque, Benjamin; Tondato, Silvia Beatriz; Asteroidal quadruples in non rooted path graphs; Discussiones Mathematicae Graph Theory; Discussiones Mathematicae Graph Theory; 35; 4; 1-2015; 603-614 2083-5892 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.7151/dmgt.1821 info:eu-repo/semantics/altIdentifier/url/http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1821 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Discussiones Mathematicae Graph Theory |
publisher.none.fl_str_mv |
Discussiones Mathematicae Graph Theory |
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_ |
1842269159457554432 |
score |
13.13397 |