| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
On the Meyniel condition for hamiltonicity in bipartite digraphs
Abstract : 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.
Keywords :
Discrete Mathematics
Graph Theory
Cited literature [8 references]
https://hal.inria.fr/hal-01179219
Contributor : Hélène Lowinger <>
Submitted on : Wednesday, July 22, 2015 - 9:15:20 AM
Last modification on : Monday, November 23, 2020 - 12:52:03 PM
Long-term archiving on: : Friday, October 23, 2015 - 10:25:03 AM
Contributor : Hélène Lowinger <>
Submitted on : Wednesday, July 22, 2015 - 9:15:20 AM
Last modification on : Monday, November 23, 2020 - 12:52:03 PM
Long-term archiving on: : Friday, October 23, 2015 - 10:25:03 AM
File
dmtcs-16-1-17.pdf
Publisher files allowed on an open archive