A sufficient condition for maximum cycles in bipartite digraphs
Let \(a\) denote the size of the smaller colour class of a directed bipartite graph \(D\). The authors show that \(D\) has a cycle of length \(2a\) if for any two nodes \(u\) and \(v\) of \(D\) either \(v\) dominates \(u\) or the sum of the in-degree of \(u\) and the out-degree of \(v\) is at least \(a+2\).
scientific article; zbMATH DE number 1382639