A PARITY DIGRAPH HAS
Mostafa Blidia · 1986
A kernel of a digraph D = (V, U) is a subset K c= V which is both independent and absorbing. This notion was introduced after game theory concept due to VonNeumann--Morgenstern [1], [7], [8]. Not all digraphs have a kernel, different sufficient conditions are known in the literature implying the existence of kernels [2], [3], [4], [5], [6]. In this paper, answering a problem proposed by P. Duchet, we prove that a parity digraph has a kernel.