Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Recognizing clique graphs of directed edge path graphs
Author: Gutierrez, M
Meidanis, J
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. (C) 2002 Elsevier Science B.V. All rights reserved.
Subject: clique graphs
intersection graphs
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/S0166-218X(02)00203-2
Date Issue: 2003
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000180274300010.pdf101.76 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.