As for rainbow paths and cycles in bipartite decompositions, as mentioned
in the introduction, they were considered under the name aggregates
in [1]}, their study being motivated by linear
logic. A proof of rainbow-structure for this special case, which does not
rely on another result such as Kotzig's or Yeo's theorems (respectively
theorems REF  and REF ), was the main result of this chapter
[1]}. Retoré would later adapt this into a
direct proof of Kotzig's theorem in [3]}.
