12 citations · 97 across the 34 of their papers we have counts for
1 paper · 1 filter
Ramin Javadi, Sepehr Hajebi
The smallest number of cliques, covering all edges of a graph G, is called the (edge) clique cover number of G and is denoted by cc(G). It is an easy observation that f…