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 ...