A new method to extend kernel-perfect graphs to kernel-perfect critical graphs (Q1121904)

A digraph D is said to be kernel-perfect if every induced subdigraph of D has a kernel and it is said to be kernel-perfect critical if every proper induced subdigraph of D has a kernel but D does not. In this communication it is stated that for arbitrary kernel-perfect digraph D there exists a kernel-perfect critical digraph \(D^*\) such that D is an induced subdigraph of \(D^*\).