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

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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!