Abstract

A simple adjacency criterion is presented which, when satisfied, implies that a minimal imperfect graph is an odd hole or an odd antihole. For certain classes of graphs, including K 1,3 -free graphs, it is straightforward to validate this criterion and thus establish the Strong Perfect Graph Theorem for such graphs.

Full Text
Published version (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