2015/12/01 by Janusz Adamus, Adamus, Janusz
Mathematics · #05C20 #05C38 #05C45 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C20 #msc:05C38 #msc:05C45
paper · pdf · doi:10.48550/arxiv.1512.00480
9 pages. arXiv admin note: text overlap with arXiv:1506.07949 by other authors
arxiv created 2015/12/01 · arxiv updated 2015/12/03
We prove that a strongly connected balanced bipartite digraph D of order 2a is hamiltonian, provided a≥3 and d(x)+d(y)≥ 3a for every pair of vertices x, y with a common in-neighbour or a common out-neighbour in D.