Question: 2. Consider the following graph. a e h (a) Determine the chromatic number of G. Give a minimal colouring and a proof that a
2. Consider the following graph. a e h (a) Determine the chromatic number of G. Give a minimal colouring and a proof that a smaller number of colours is not possible. (6) (b) Determine whether G has an Euler cycle or an Euler trail. (4) (c) Determine the number of edges in the complement of the graph. (3) (d) Determine a breadth-first spanning tree with i as root. (4)
Step by Step Solution
3.54 Rating (164 Votes )
There are 3 Steps involved in it
Let the given gaph be denoted by G obdeh ve that IVCGlthe num... View full answer
Get step-by-step solutions from verified subject matter experts
