Hi I have a question regarding definition of Edge Clique cover problem. It defined as: we are given a graph G and a nonnegative integer k, and the goal is to decide whether the edges of G can be covered by at most k cliques.
Now, suppose you have the following graph: (v1,v2), (v1,v3), (v3,v2), (v3,v4), (v4,v2). Then if we say k=3, then it would return yes; because we have triangle v2v3v4 and two left edges: (v1,v3) and (v1,v2). Now, if k=4 then it would return no; because we cannot cover the whole graph by any clique with k=4. Now, k=5, then it would return yes; because number of edges are …