1 paper · 1 filter
Vladislav Taranchuk, Craig Timmons
A complete partition of a graph G is a partition of the vertex set such that there is at least one edge between any two parts. The largest r such that G has a complete partit…