Revisiting classical results on kernels in digraphs

Hélène Langlois, Frédéric Meunier

In a digraph, a kernel is a subset of vertices that is both independent and absorbing. Kernels have important applications in combinatorics and outside. Kernels do not always exist…