Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments

H. Galeana-Sánchez, M. Olsen

A digraph such that every proper induced subdigraph has a kernel is said to be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI for short) resp.) if the…