Independent sets which meet all longest paths

dc.contributor.author	RinconMejia, HA
dc.contributor.author	GaleanaSánchez, H
dc.date.accessioned	2011-01-22T10:28:23Z
dc.date.available	2011-01-22T10:28:23Z
dc.date.issued	1996
dc.identifier.issn	0012-365X
dc.identifier.uri	http://hdl.handle.net/11154/2961
dc.description.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''.	en_US
dc.language.iso	en	en_US
dc.title	Independent sets which meet all longest paths	en_US
dc.type	Article	en_US
dc.identifier.idprometeo	3095
dc.source.novolpages	152(40603):141-145
dc.subject.wos	Mathematics
dc.description.index	WoS: SCI, SSCI o AHCI
dc.relation.journal	Discrete Mathematics