On the Meyniel condition for hamiltonicity in bipartite digraphsArticle
Authors: Janusz Adamus 1,2,3; Lech Adamus 4; Anders Yeo 5
NULL##NULL##0000-0003-0293-8708
Janusz Adamus;Lech Adamus;Anders Yeo
1 Department of Mathematics [London, Ontario]
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
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.
Funder: Natural Sciences and Engineering Research Council of Canada
Bibliographic References
2 Documents citing this article
Samvel Darbinyan;Iskandar Karapetyan, 2018, On a Problem of Wang Concerning the Hamiltonicity of Bipartite Digraphs, Mathematical Problems of Computer Science, pp. 26-34, 10.51408/1963-0003, https://doi.org/10.51408/1963-0003.