B1- and B2-orientable graphs in kernel theory

In this note I prove that B1or B2-oriented digraphs satisfy the following conjecture proposed by Meyniel (1980): if every directed cycle of odd length in a digraph D has at least two pseudodiagonals then D has a kernel.