Clique-partitioned graphs

Grahame Erskine, Terry Griggs, Jozef Širáň

A graph $G$ of order $nv$ where $n\ge 2$ and $v\ge 2$ is said to be weakly $(n,v)$-clique-partitioned if its vertex set can be decomposed in a unique way into $n$ vertex-disjoint…