The number of hypohamiltonian and that of hypotraceable \(n\)-vertex digraphs are both bounded below by a superexponential function of \(n\) for \(n \geq 6\) and \(n \geq 7\), respectively.
Citation
Zdzislaw Skupien. Hypohamiltonian/hypotraceable Digraphs Abound[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 024. 239-242. DOI: .