A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs

Abstract

We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$, $a\ge 3$, satisfying $d(u)+d(v)\ge 3a$ for every pair of vertices $u,v$ with a common in-neighbour or a common out-neighbour, is either bipancyclic or a directed cycle of length $2a$.

Final version, to appear in Graphs Combin

References in corpus (1)

• A sufficient condition for a balanced bipartite digraph to be hamiltonian