Use Grinberg's theory to prove the grpah has not Hamilton circuit

Theorem 3 (Grinberg, 1968) Suppose a planar graph G has a Hamilton circuit H. Let G be drawn with any planar depiction, and let r; denote the number of regions inside the Hamilton circuit bounded by i edges in this depiction. Let rf be the number of regions outside the circuit bounded by i edges. Then the numbers ri and rf satisfy the equation Just as the inequality e