A Degree Sum Condition for Hamiltonicity in Balanced Bipartite Digraphs

作者：Adamus Janusz^*

来源：Graphs and Combinatorics, 2017, 33(1): 43-51.

DOI：10.1007/s00373-016-1751-6

• Digraph
• Bipartite digraph
• Cycle
• Hamiltonicity
• Degree condition

We prove that a strongly connected balanced bipartite digraph D of order 2a is hamiltonian, provided and for every pair of vertices x, y with a common in-neighbour or a common out-neighbour in D.

• 出版日期2017-1