Title of article
Kernels in digraphs that are not kernel perfect
Author/Authors
Dyrkolbotn، نويسنده , , Sjur and Walicki، نويسنده , , Micha?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
8
From page
2498
To page
2505
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
05C20 , Undirected path parity , Digraph kernel , Breaking odd cycles , Not kernel perfect , Parity condition
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1600053
Link To Document