A sufficient condition for Hamiltonian cycles in bipartite tournaments
Jing Ping Tang, Jianzhong Wang, Wanpeng Lei · Analysis in Theory and Applications · 2007
In this paper, we present a new sufficient condition on degrees for a bipartite tournament to be Hamiltonian, that is, if an n × n bipartite tournament T satisfies the condition W ( n − 3), then T is Hamiltonian, except for four exceptional graphs. This result is shown to be best possible in a sense.