A generalization of the Hamiltonian cycle in dense digraphs

Jie Zhang, Zhilan Wang, Jin Yan

Let D be a digraph and C be a cycle in D. For any two vertices x and y in D, the distance from x to y is the minimum length of a path from x to y. We denote the square of Let $D$ b…