1. A robust Corrádi-Hajnal theorem;Allen;Random Struct. Algorithms,2024
2. M. Anastos, D. Chakraborti, D.Y. Kang, A. Methuku, V. Pfenninger, Robust hamiltonicity of Dirac hypergraphs, (2023) forthcoming.
3. On the maximal number of independent circuits in a graph;Corradi;Acta Math. Acad. Sci. Hung.,1963
4. Hamiltonian cycles in Dirac graphs;Cuckler;Combinatorica,2009
5. Some theorems on abstract graphs;Dirac;Proc. Lond. Math. Soc. (3),1952