1. Balister, P.N., Győri, E., Lehel, J., Schelp, R.H.: Connected graphs without long paths. Discrete Math. 308(19), 4487–4494 (2008)
2. 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, vol. 260, pp. 39–43. CNRS, Paris (1978)
3. Clemens, D., Ehrenmüller, J., Person, Y.: A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs, Electron. Notes. Discrete Math. 54, 181–186 (2016)
4. Clemens, D., Ehrenmüller, J., Person, Y.: A Dirac-type theorem for Berge cycles in random hypergraphs. Electron. J. Combin. 27(3), 3.39 (2020)
5. Coulson, M., Perarnau, G.: A rainbow Dirac’s theorem. SIAM J. Discrete Math. 34(3), 1670–1692 (2020)