Recognizing clique graphs of directed edge path graphs

Autores
Gutiérrez, Marisa; Meidanis, João
Año de publicación
2003
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Directed edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them.
Facultad de Ciencias Exactas
Materia
Ciencias Exactas
Clique graphs
Intersection 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/83487
Acceder
id SEDICI_9801c86caa7374b01307c70f1b8c1589
oai_identifier_str oai:sedici.unlp.edu.ar:10915/83487
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Recognizing clique graphs of directed edge path graphsGutiérrez, MarisaMeidanis, JoãoCiencias ExactasClique graphsIntersection graphsDirected edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them.Facultad de Ciencias Exactas2003info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf297-304http://sedici.unlp.edu.ar/handle/10915/83487enginfo:eu-repo/semantics/altIdentifier/issn/0166-218Xinfo:eu-repo/semantics/altIdentifier/doi/10.1016/S0166-218X(02)00203-2info: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:48:09Zoai:sedici.unlp.edu.ar:10915/83487Institucionalhttp://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:48:09.669SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Recognizing clique graphs of directed edge path graphs
title Recognizing clique graphs of directed edge path graphs
spellingShingle Recognizing clique graphs of directed edge path graphs
Gutiérrez, Marisa
Ciencias Exactas
Clique graphs
Intersection graphs
title_short Recognizing clique graphs of directed edge path graphs
title_full Recognizing clique graphs of directed edge path graphs
title_fullStr Recognizing clique graphs of directed edge path graphs
title_full_unstemmed Recognizing clique graphs of directed edge path graphs
title_sort Recognizing clique graphs of directed edge path graphs
dc.creator.none.fl_str_mv Gutiérrez, Marisa
Meidanis, João
author Gutiérrez, Marisa
author_facet Gutiérrez, Marisa
Meidanis, João
author_role author
author2 Meidanis, João
author2_role author
dc.subject.none.fl_str_mv Ciencias Exactas
Clique graphs
Intersection graphs
topic Ciencias Exactas
Clique graphs
Intersection graphs
dc.description.none.fl_txt_mv Directed edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them.
Facultad de Ciencias Exactas
description Directed edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them.
publishDate 2003
dc.date.none.fl_str_mv 2003
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/83487
url http://sedici.unlp.edu.ar/handle/10915/83487
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/0166-218X
info:eu-repo/semantics/altIdentifier/doi/10.1016/S0166-218X(02)00203-2
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
297-304
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_ 1842260355616604160
score 13.13397

Publicaciones similares