1 problem

Let $G$ be a simple graph with $n$ vertices. A clique is a set of vertices inducing a complete graph, and the edge clique cover number $ecc(G)$ is the minimum number of cliques suc…