2 papers
math.CO2024
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 b…
math.CO2024
Cycle-factors in oriented graphs
Zhilan Wang, Jin Yan, Jie Zhang
Let be a positive integer. A -cycle-factor of an oriented graph is a set of disjoint cycles of length that covers all vertices of the graph. In this paper, we prove that…