Abstract
A graph is murky if neither the graph nor its complement contains a chordless cycle with five vertices or a chordless path with six vertices. A star cutset in a graph G is a set C of vertices, such that G − C is disconnected, and such that some vertex in C is adjacent to all remaining vertices in C. A graph is called unbreakable if it has more than two vertices and if neither the graph nor its complement has a star cutset. The main result is a proof that murky graphs are perfect. A characterization of unbreakable murky graphs is also presented.
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
