Question: Let G be a connected planar graph such that its Dual graph G* has a Hamiltonian cycle. Prove that G can be colored with 4
Let G be a connected planar graph such that its Dual graph G* has a Hamiltonian cycle. Prove that G can be colored with 4 different colors. (Do not use 4-color theorem please)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
