Abstract
We prove that a strongly connected balanced bipartite digraph of order is hamiltonian, provided and for every pair of vertices , with a common in-neighbour or a common out-neighbour in .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.