首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A sufficient condition for a digraph to be kernel-perfect
Authors:P Duchet
Abstract:Galeana-Sanchez and Neumann-Lara proved that a sufficient condition for a digraph to have a kernel (i.e., an absorbent independent set) is the following: (P) every odd directed cycle possesses at least two directed chords whose terminal endpoints are consecutive on the cycle. Here it is proved that (P) is satisfied by those digraphs having these two properties: (i) the reversal of every 3-circuit is present, and (ii) every odd directed cycle v1v2n+1 V1 has two chords of the form (vi, vi+2). This is stronger than a result of Galeana-Sanchez.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号