17 papers
Sparse spanning -strong oriented subdigraphs in split digraphs
Jia Zhou, Jørgen Bang-Jensen, Jin Yan
Jackson and Thomassen conjectured that every -strong digraph admits a spanning -strong oriented subdigraph [Ann. N. Y. Acad. Sci. 555 (1989) 402-412]. The conjecture holds f…
An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs
Yufei Chang, Shuo Wei, Jin Yan
Let , let denote the transitive tournament on vertices, and write . We prove that if and an -vertex digraph s…
Highly connected spanning oriented subdigraphs in generalizations of semicomplete digraphs
Jia Zhou, Jørgen Bang-Jensen, Tong Zhou +1
Let be a positive integer. Jackson and Thomassen conjectured in 1989 that there exists an integer function such that every -strong digraph admits a spanning -st…
K-Arc-Strong Orientations Of Semicomplete Digraphs
Tong Zhou, Jørgen Bang-Jensen, Jia Zhou +1
Results by Jackson and Frank imply that every 2k-arc-strong digraph D contains a spanning k-arc-strong oriented subdigraph. This is best possible, even for very dense digraphs. A d…
The exact total degree threshold for the square of a Hamilton cycle in digraphs
Zhilan Wang, Shuo Wei, Jin Yan
The paper determines the exact minimum total degree condition that guarantees the square of a Hamilton cycle in large directed graphs, confirming the conjecture of DeBiasio et al.…
Polynomial Algorithms for Minimum Degree Partitions in Semicomplete Digraphs
Hanzhi Bai, Jin Yan
A 2-partition of a digraph is a partition of its vertex set into two nonempty parts. Degree-constrained 2-partition problems are generally computationally difficult, even when the…