Authors: Janusz Adamus ^1,2,3; Lech Adamus ⁴; Anders Yeo ⁵

• 1 Department of Mathematics [London, Ontario] [PAN]
• 2 Polska Akademia Nauk = Polish Academy of Sciences
• 3 Polska Akademia Nauk = Polish Academy of Sciences = Académie polonaise des sciences
• 4 Faculty of Applied Mathematics [Krakow]
• 5 Singapore University of Technology and Design

Graph Theory

[en]
We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For a≥2, a strongly connected balanced bipartite digraph D on 2a vertices is hamiltonian if d(u)+d(v)≥3a whenever uv∉A(D) and vu∉A(D). As a consequence, we obtain a sharp sufficient condition for hamiltonicity in terms of the minimal degree: a strongly connected balanced bipartite digraph D on 2a vertices is hamiltonian if δ(D)≥3a/2.