On 3-regular digraphs without vertex disjoint cycles of different lengths

We raise the conjecture that for every integer g≥3 there are only finitely many 3-regular digraphs of girth g without vertex disjoint directed cycles of different lengths and give support for this conjecture by proving that it is true for g=3.