Question: (a) Provide a 3-colouring(e) for the graph below to prove that it is not a snark. (b) Up to isomorphism (assuming that colours are interchangeable)

(a) Provide a 3-colouring(e) for the graph below to prove that it is not a snark. (b) Up to isomorphism (assuming that colours are interchangeable) there is only one 3-colouring(e) of a pentagon. Describe this colouring. (c) Using part (b) on the outside pentagon of the Peterson graph explain why it is not possible to 3-colour(e) the Peterson graph (provide a diagram). (d) Using (c), explain why the Peterson graph is not Hamiltonian
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
