On the existence of 3- and 4-kernels in digraphs

A classical result due to Duchet states that if every directed cycle in a digraph D has at least one symmetric arc, then D has a kernel. We propose a conjecture generalizing this result for k-kernels and prove it true for k=3 and k=4.