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.
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
