Kernels in digraphs that are not kernel perfect

An equivalent of kernel existence is formulated using semikernels. It facilitates inductive arguments, which allow us to establish several sufficient conditions for the existence of kernels in finite digraphs. The conditions identify classes of digraphs that have kernels without necessarily being kernel perfect.