Ciencias,UNAM
Independent sets which meet all longest paths
DSpace/Manakin Repository
Login
DSpace Home
→
Repositorio Ciencias
→
FACULTAD DE CIENCIAS
→
Matemáticas
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Independent sets which meet all longest paths
RinconMejia, HA
;
GaleanaSánchez, H
URI:
http://hdl.handle.net/11154/2961
Email
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''.
Show full item record
Files in this item
Name:
Independent sets ...
Size:
284.7Kb
Format:
PDF
Description:
Articulo publicado
View/
Open
This item appears in the following Collection(s)
Matemáticas
[184]
Search DSpace
Search DSpace
This Collection
Advanced Search
Browse
All of DSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
By Submit Date
This Collection
By Issue Date
Authors
Titles
Subjects
By Submit Date
My Account
Login
Register