1. Bermond, J.-C., Germa, A., Heydemann, M.-C., Sotteau, D.: Hypergraphes Hamiltoniens, in Problèmes combinatoires et thèorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). Colloq. Internat. CNRS, 260 (CNRS, Paris, 1978), 39–43
2. Clemens, D., Ehrenmüller, J., Person, Y.: A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs. Electron. J. Combin. 54, 181–186 (2020)
3. Coulson, M., Perarnau, G.: A Rainbow Dirac’s Theorem. SIAM J. Discrete Math. 34, 1670–1692 (2020)
4. Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 3(2), 69–81 (1952)
5. Enomoto, H.: Long paths and large cycles in finite graphs. J. Graph Theory 8, 287–301 (1984)