Can I read On the Meyniel condition for hamiltonicity in bipartite digraphs on EtoBox?

On the Meyniel condition for hamiltonicity in bipartite digraphs by Adamus, Janusz; Adamus, Lech is a scholarly article available to read on EtoBox.

What is On the Meyniel condition for hamiltonicity in bipartite digraphs about?

We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For k greater than or equal to 2, a bipartite digraph D with colour classes of cardinalities k is hamiltonian if the sum of degrees of vertices u and v is at least 3k+1 for every pair of vertices u, v such that D does not contain the arc uv nor vu. As a consequence, we obtain a sharp sufficient condition for hamiltonicity in terms of the minimal degree: a balanced bipartite digraph D on 2k vertices is hamiltonian if its minimal degree is at least (3k + 1)/2.

Author

Adamus, Janusz; Adamus, Lech

Published

2012

Language

EN