Abstract
In this paper we investigate structural properties of a certain class of graphs ( ▪-free graphs) which are relevant in the study of kernel theory, ▪-free graphs satisfy the strong perfect graph conjecture of Berge. We investigate orientations of ▪-free graphs and other classes of graphs which produce kernel-perfect diagraphs.
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.
