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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
