Victor Neumann-Lara

Learn More
In this paper we investigate new sufficient conditions for a digraph to be kernel-perfect (KP) and some structural properties of kernel-perfect critical (KPC) digraphs. In particular, it is proved that the asymmetrical part of any KPC digraph is strongly connected. A new method to construct KPC digraphs is developed. The existence of KP and KPC digraphs(More)