Question: Using theorem 3 prove that the given graph has no hamilton circuit. Theorem 3 (Grinberg, 1968) Janar graph G has a Hamilton circuit H. Let

Theorem 3 (Grinberg, 1968) Janar graph G has a Hamilton circuit H. Let G be drawn with any planar andler denote the number of regions inside the Hamilton circuit bounded by i edges in this depiction. Letr be the number of regions outside the circuit bounded by i edges. Then the numbers r; and r satisfy the equation si - 2)(r; - r)=0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
