Let D be a directed graph of order n. An anti-directed Hamilton cycle H in D is a Hamilton cycle in the graph underlying D such that no pair of consecutive arcs in H form a directed path in D. We prove that if D is a directed graph with even order n and if the indegree and the outdegree of each vertex of D is at least 23n then D contains an anti-directed Hamilton cycle. This improves a bound of...
