Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2019-10-17T14:36:09Z
dc.date.available 2019-10-17T14:36:09Z
dc.date.issued 2003
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/83487
dc.description.abstract 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. en
dc.format.extent 297-304 es
dc.language en es
dc.subject Clique graphs es
dc.subject Intersection graphs es
dc.title Recognizing clique graphs of directed edge path graphs en
dc.type Articulo es
sedici.identifier.other doi:10.1016/S0166-218X(02)00203-2 es
sedici.identifier.other eid:2-s2.0-84867939565 es
sedici.identifier.issn 0166-218X es
sedici.creator.person Gutiérrez, Marisa es
sedici.creator.person Meidanis, João es
sedici.subject.materias Ciencias Exactas es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Ciencias Exactas es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.description.peerReview peer-review es
sedici.relation.journalTitle Discrete Applied Mathematics es
sedici.relation.journalVolumeAndIssue vol. 126, no. 2-3 es


Descargar archivos

Thumbnail
Documento completo
Descargar archivo (434.9Kb) - PDF

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)