Grinstead's conjecture is true for graphs with a small clique number

We will show that Grinstead's Conjecture holds true if  min(α(G),ω(G))≦8min(α(G),ω(G))≦8. In other words; a circular partitionable graph G satisfying  min(α(G),ω(G))≦8min(α(G),ω(G))≦8is always a so-called “CGPW-graph”.