A degree sum condition for hamiltonicity in balanced bipartite digraphs

Janusz Adamus

Published 2015-12-01Version 1

We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$ is hamiltonian, provided $a\geq3$ and $d(x)+d(y)\geq 3a$ for every pair of vertices $x$, $y$ with a common in-neighbour or a common out-neighbour in $D$.