Grinsteadʹs conjecture is true for graphs with a small clique number Original Research Article

We will show that Grinsteadʹs Conjecture holds true if image. In other words; a circular partitionable graph G satisfying image is always a so-called “CGPW-graph”.