Problem 8 15 Marks Let G V E Undirected Graph Vertex V Degree D V Number Edges Incident V Q37142158

Problem 8. (15 marks) a) Let G – (V, E) be an undirected graph such that, for any vertex v, degree d(v) (number of edges incident to v) is bounded by 3. Given such a graph and an integer k we want to determine if G contains a clique of size 2 k. Show that this problem is in P. Dose this contradict to the fact that b) The composite numbers

OR

 

OR