Abstract
A directed graph is said to be kernel-perfect if every induced subgraph possesses a kernel (independent, absorbing subset). A necessary condition for a graph to be kernel-perfect is that every complete subgraph C has an absorbing vertex (i.e., a successor of all vertices of C). In this work, we show that this condition is sufficient for i-triangulated graphs, where every odd cycle has two non-crossing chords. This result appears as a special case of a general relationship between the notion of kernel-perfectness and the well known strong perfect graph conjecture of Berge.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
