Discrete MathematicsVolume 164, Issues 1–3, 10 February 1997, Pages 313-316NoteAn upper bound for the Hamiltonicity exponent of finite digraphsAuthor links open overlay panelGünter Schaar a, A. Pawel Wojda bShow moreShareCitehttps://doi.org/10.1016/S0012-365X(96)00066-0Get rights and contentUnder an Elsevier user licenseopen archiveAbstractLet D be a strongly k-connected digraph of order n ⩾ 2. We prove that for every l ⩾ n/2k the power D1 of D is Hamiltonian. Moreover, for any k ⩾ 1 and n > 2k we exhibit a strongly k-connected digraph D of order n such that D⌈n2k⌉−1 is non-Hamiltonian.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1997 Published by Elsevier B.V.