1 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Ramin Javadi, Zeinab Maleki, Behnaz Omoomi
A k-clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-cliq…