Course Solutions Uncategorized (Solved) : 2 24 Marks K 2 2 Consider Following Decision Problem K Colouring Pre Condition Undirected Q28324781 . . . .

(Solved) : 2 24 Marks K 2 2 Consider Following Decision Problem K Colouring Pre Condition Undirected Q28324781 . . . .

 

2. (24 marks) For any k 2 2, consider the following decision problem: k-COLOURING Pre-condition: an undirected graph G-(V, E) where V is a set of vertices for G and E is a set of edges described as tuples of vertices in G Post-condition: output yes if there exists a a colouring of the graph with k distinct colours in such a way that no two adjacent vertices are coloured the same colour. Output Examples of graphs and colourings include Kn- the complete graph on n vertices is n-colourable, but not (n -1) colourable Km,n - the complete bipartite 

<div class=

OR

PayPal Gateway not configured

OR

PayPal Gateway not configured

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Post