Authors: C. Balbuena, H. Galeana-Sánchez, M.-k. Guevara Title: About (k,l)-kernels, semikernels and Grundy functions in partial line digraphs Source: Discussiones Mathematicae Graph Theory Received 28.06.2016, Revised 09.12.2017, Accepted 11.12.2017, doi: 10.7151/dmgt.2104 Abstract: Let D be a digraph of minimum in-degree at least 1. We prove that for any two natural numbers k,l such that 1\le l \le k, the number of (k,l)-kernels of D is less than or equal to the number of (k,l)-kernels of any partial line digraph \mathcal{L} D. Moreover, if l