1. Ahmed, T., A survey on the Chvátal-Erdős theorem,
https://doi.org/citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.90.9100&rep=repl&type=pdf
2. Ainouche, A., Common generalization of Chvátal-Erdős and Fraisse’s sufficient conditions for Hamiltonian graphs, Discrete Math., 142, 1995, 21–26.
3. Akiyama, J. and Kano, M., Factors and Factorizations of Graphs: Proof Techniques in Factor Theory, Lecture Notes in Mathematics, 2031, Springer-Verlag, Heidelberg, 2011.
4. Chen, G., Hu, Z. and Wu, Y., Circumferences of k-connected graphs involving independence numbers, J. Graph Theory, 68, 2011, 55–76.
5. Chen, G., Li, Y., Ma, H., et al., An extension of the Chvátal-Erdős theorem: Counting the number of maximum independent sets, Graphs Combin, 31, 2015, 885–896.