Henning and Yeo SIAM J. Discrete Math. 26 (2012) 687–694
conjectured that a 3regular digraph D contains two vertex disjoint
directed cycles of different length if either D is of sufficiently large
order or D is bipartite. In this paper, we disprove the first conjecture.
Further, we give support for[r]