[1] BÄBLER F.: Über eine spezielle Klasse Euleгscheг Graphen. Comment. Math. Helv. 27, 1953, 81-100. MR 0056273

[2] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Gгaphs V Digraphs. Wadsworth International, Belmont, CA, 1979.

[3] CHARTRAND G., HKRONK H. V.: Randomly traceable graphs. SIAM J. Appl. Math. 16, 1968, 696-700. MR 0234852

[4] CHARTRAND G., KRONK H. V., LICK D. R.: Randomly hamiltonian digraphs. Fund. Math. 65, 1969, 223-226. MR 0246788 | Zbl 0181.27304

[5] CHARTRAND G., LICK D. R.: Randomly eulerian digraphs. Czech. Math. J. 21, 1971, 424-430. MR 0288052 | Zbl 0221.05066

[6] CHARTRAND G., WHITE A. T.: Randomly traversable graphs. Elem. Math. 25, 1970, 101-107. MR 0285426 | Zbl 0199.27401

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

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

[9] FINK J. F.: Randomly antitraceable digraphs. J. Graph Theory 6, 1982, 481-488. MR 0679604 | Zbl 0498.05036

[10] FINK J. F.: Randomly near-tranceable graphs. (Submitted for publication)

[11] HARARY F.: On arbitrarily traceable graphs and directed graphs. Scripta Math. 23, 1957, 37-41. MR 0099041

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

[13] ORE O.: A problem regarding the tracing of graphs. Elem. Math. 6, 1951, 49-53. MR 0041418 | Zbl 0043.38503

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

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

[16] THOMASSEN C.: On randomly Hamiltonian graphs. Math. Ann. 200, 1973, 195-208. MR 0325456 | Zbl 0233.05121

[17] THOMASSEN C.: Graphs in which every path is contained in a Hamiltonian path. J. Reine Angew. Math. 268/269, 1974, 271-282. MR 0349484