Question: Let G be a simple plane graph with fewer than 12 faces, and suppose that each vertex of G has degree at least 3. (i)
Let G be a simple plane graph with fewer than 12 faces, and suppose that each vertex of G has degree at least 3. (i) Use Exercise 13.5 to prove that G is 4-colourable(v). (ii) Dualize the result of part (i). 19.7*
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
