Recognizing clique graphs of directed edge path graphs

dc.creatorGutierrez, M
dc.creatorMeidanis, J
dc.date2003
dc.date42064
dc.date2014-11-18T07:31:11Z
dc.date2015-11-26T16:52:28Z
dc.date2014-11-18T07:31:11Z
dc.date2015-11-26T16:52:28Z
dc.date.accessioned2018-03-28T23:39:26Z
dc.date.available2018-03-28T23:39:26Z
dc.identifierDiscrete Applied Mathematics. Elsevier Science Bv, v. 126, n. 41700, n. 297, n. 304, 2003.
dc.identifier0166-218X
dc.identifierWOS:000180274300010
dc.identifier10.1016/S0166-218X(02)00203-2
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/80644
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/80644
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/80644
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1276292
dc.descriptionDirected 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. (C) 2002 Elsevier Science B.V. All rights reserved.
dc.description126
dc.description41700
dc.description297
dc.description304
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationDiscrete Applied Mathematics
dc.relationDiscret Appl. Math.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectclique graphs
dc.subjectintersection graphs
dc.subjectIntersection Graphs
dc.subjectHelly Graphs
dc.titleRecognizing clique graphs of directed edge path graphs
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución