Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
Ruixia Wang · Journal of Graph Theory · 2020
Abstract Adamus et al proved that: a balanced bipartite digraph of order is Hamiltonian if whenever and belong to different partite sets and . They also showed that the bound is sharp. In this paper, we shall show that the extremal digraph of this condition is a digraph of six vertices.