On the Meyniel condition for hamiltonicity in bipartite digraphs - Archive ouverte HAL
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

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.
Fichier principal
Vignette du fichier
dmtcs-16-1-17.pdf (4 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01179219 , version 1 (22-07-2015)

Identifiers

Cite

Janusz Adamus, Lech Adamus, Anders Yeo. On the Meyniel condition for hamiltonicity in bipartite digraphs. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.293--302. ⟨10.46298/dmtcs.1264⟩. ⟨hal-01179219⟩

Collections

TDS-MACS
101 View
1209 Download

Altmetric

Share

More