Let D = (V,A) be a digraph with minimum in-degree at least 1 and girth at least l+1,\ud
where l ≥ 1. In this work, the following result is proved: a digraph D has a (k,l)-kernel if and only if its partial line digraph LD does, where 1 ≤ l < k. As a consequence, the h-iterated line digraph $L^h$(D) is shown to have a kernel if and only if D has a kernel.Postprint (published version
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.