The special case of bipartite decompositions has been considered in a
number of works on combinatorics focusing on the minimum number of colors needed
for a bipartite decomposition of a given graph. For instance, a well-known
result is that all bipartite decompositions of the complete graph \(K_n\)  use at
least \(n-1\)  colors [1]}.
