J. Shen, “On the Girth of Digraphs,” Discrete Mathematics, Vol. 211, No. 1-3, 2000, pp. 167-181. doi:10.1016/S0012-365X(99)00323-4
has been cited by the following article:
TITLE: A Note on Directed 5-Cycles in Digraphs
AUTHORS: Hao Liang, Junming Xu
KEYWORDS: Digraph; Directed Cycle
JOURNAL NAME: Applied Mathematics, Vol.3 No.7, June 21, 2012
ABSTRACT: In this note, it is proved that if α≥0.24817, then any digraph on n vertices with minimum outdegree at least αn contains a directed cycle of length at most 5.