Previous |  Up |  Next

Article

References:
[1] G. Chartrand H. V. Kronk: Randomly traceable graphs. SIAM J. Appl. Math. 16 (1968) 696-700. DOI 10.1137/0116056 | MR 0234852
[2] G. Chartrand H. V. Kronk D. R. Lick: Randomly hamiltonian digraphs. Fund. Math. 65 (1969) 223-226. MR 0246788
[3] G. Chartrand D. R. Lick: Randomly eulerian digraphs. Czech. Math. J. 21 (1971) 424-430. MR 0288052
[4] G. Chartrand О. R. Oellermann S. Ruiz: Randomly $H$-Graphs. To appear in Math. Slovaca. MR 0849703
[5] G. A. Dirac C. Thomassen: Graphs in which every finite path is contained in a circuit. Math. Ann. 203 (1973) 65-75. DOI 10.1007/BF01349245 | MR 0335352
[6] D. B. Erickson: Arbitrarily traceable graphs and digraphs. J. Combinatorial Theory Ser. В 19 (1975) 5-23. DOI 10.1016/0095-8956(75)90070-2 | MR 0398898 | Zbl 0278.05109
[7] F. Harary: On arbitrarily traceable graphs and directed graphs. Scripta Math. 23 (1957) 37-51. MR 0099041
[8] О. Ore: А problem regarding the tracing of graphs. Elem. Math. 6 (1951) 49-53. MR 0041418 | Zbl 0043.38503
[9] T. D. Parsons: Paths extendable to cycle. J. Graph Theory 2 (1978) 337-339. DOI 10.1002/jgt.3190020408 | MR 0505821
[10] J. Sheehan: Fixing Subgraphs and Ulam's Conjecture. J. Combinatorial Theory 14 (1973) 125-131. DOI 10.1016/0095-8956(73)90055-5 | MR 0316317 | Zbl 0271.05125
[11] J. Sheehan: Fixing sub-graphs. J. Combinatorial Theory 12 (1972) 226-244. DOI 10.1016/0095-8956(72)90037-8
[12] D. P. Sumner: Randomly matchable graphs. J. Graph Theory 3 (1979) 183-186. DOI 10.1002/jgt.3190030209 | MR 0530304 | Zbl 0404.05053
Partner of
EuDML logo