Abstract
This paper presents an algorithmic proof of the validity of the Strong Perfect Graph Conjecture for graphs whose largest clique is a triangle. The proof leads to an O( n 3) algorithm to 3-color such graphs. In the process, a method is presented to contract a perfect graph into a set of smaller perfect graphs that are ( K 4-e )-free.
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.
