1. R. E. L. Aldred, Y. Egawa, J. Fujisawa, K. Ota and A. Saito, The existence of a 2-factor in K
1,n
-free graphs with large connectivity and large edge-connectivity, preprint.
2. D. Amar, I. Fournier and A. Germa, Pancyclism in Chvátal-Erdős’s graphs, Graphs Combin., 7 (1991), 101–112.
3. G. Chen, R. J. Gould, K. Kawarabayashi, K. Ota, A. Saito and I. Schiermeyer, The Chvátal-Erdős condition and 2-factors with a specified number of components, preprint.
4. V. Chvátal and P. Erdős, A note on Hamilton circuits, Discrete Math., 2 (1972), 111–113.
5. Y. Egawa, J. Fujisawa, S. Fujita and K. Ota, 2-factors in r-connected
K
1k
,P
4-free graphs, preprint.