[1] CHARTRAND G., KRONK H. V.: Randomly traceable graphs. SIAM, J. Appl Math. 16, 1968,696-700. MR 0234852 | Zbl 0164.54202

[2] CHARTRAND G., OELLERMAN O. R., RUIZ S.: Randomly H Graphs. Math. Slovaca 36, 1986, 129-136. MR 0849703

[3] DIRAC G. A., THOMASEN C.: Graphs in which every finite path is contained in a circuit. Math. Ann. 203, 1973, 65-75. MR 0335352

[4] HARARY F.: Graph Theory. Addison-Wesley, Reading, Mass. 1969. MR 0256911 | Zbl 0196.27202

[5] ERICKSON D. B.: Arbitrarily traceable graphs and digraphs. J. Combin. Theory Ser. B., 19, 1975, 5-23. MR 0398898 | Zbl 0278.05109

[6] PARSONS T. D.: Paths extendable to cycle. J. Graph Theory 2, 1978, 337-339. MR 0505821

[7] SUMNER D. P.: Randomly matchable graphs. J. Graph Theory, 3, 1979, 183-186. MR 0530304 | Zbl 0404.05053

[8] TOMASTA P., TOMOVÁ E.: On H-closed graphs. Czech. Math. J. 38, 113, 1988, 404-419. MR 0950294 | Zbl 0699.05059