×

On Hamiltonian bipartite tournaments. (Chinese. English summary) Zbl 0827.05042

Summary: We prove the following result: Let \(T(n,n)\) denote an \(n\times n\) bipartite tournament. If for the arcs \(uv\) in \(T(n,n)\) we have \(d^- (u)+ d^+ (v)\geq n-2\geq 4\), then \(T(n,n)\) is Hamiltonian, except \(T(n,n)\) is isomorphic to one graph of two classes of special graphs which are described.

MSC:

05C45 Eulerian and Hamiltonian graphs
05C20 Directed graphs (digraphs), tournaments