DSpace About DSpace Software
 

Repositorio Atenea de la Facultad de Ciencias, UNAM >
Repositorio Ciencias >
FACULTAD DE CIENCIAS >
Matemáticas >

Please use this identifier to cite or link to this item: http://hdl.handle.net/11154/2961

Title: Independent sets which meet all longest paths
Authors: RinconMejia, HA
GaleanaSánchez, H
Issue Date: 1996
Abstract: We prove some sufficient conditions for a directed graph to have the property of a conjecture of J.M. Laborde, Ch. Payan and N.H. Huang (1982): ''Every directed graph contains an independent set which meets every longest directed path''.
URI: http://hdl.handle.net/11154/2961
ISSN: 0012-365X
Appears in Collections:Matemáticas

Files in This Item:

File Description SizeFormat
Independent sets which meet all longest paths.pdfArticulo publicado284.72 kBAdobe PDFView/Open

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

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback