Article ID Journal Published Year Pages File Type
6423484 Discrete Mathematics 2012 8 Pages PDF
Abstract

An equivalent of kernel existence is formulated using semikernels. It facilitates inductive arguments, which allow us to establish several sufficient conditions for the existence of kernels in finite digraphs. The conditions identify classes of digraphs that have kernels without necessarily being kernel perfect.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Kernels in digraphs that are not kernel perfect
Authors
, ,